Lombardi drawings of graphs

Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg

Research output: Contribution to journalArticle

27 Scopus citations

Abstract

We introduce the notion of Lombardi graph drawings, named after the American abstract artist Mark Lombardi. In these drawings, edges are represented as circular arcs rather than as line segments or polylines, and the vertices have perfect angular resolution: the edges are equiangularly spaced around each vertex. We describe algorithms for _nding Lombardi drawings of regular graphs, graphs of bounded degeneracy, and certain families of planar graphs.

Original languageEnglish (US)
Pages (from-to)85-108
Number of pages24
JournalJournal of Graph Algorithms and Applications
Volume16
Issue number1
DOIs
StatePublished - Jan 1 2012

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)
  • Computer Science Applications
  • Geometry and Topology
  • Computational Theory and Mathematics

Cite this

Duncan, C. A., Eppstein, D., Goodrich, M. T., Kobourov, S. G., & Nöllenburg, M. (2012). Lombardi drawings of graphs. Journal of Graph Algorithms and Applications, 16(1), 85-108. https://doi.org/10.7155/jgaa.00251