Lombardi drawings of graphs

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

Research output: Contribution to journalArticlepeer-review

37 Scopus citations


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
Issue number1
StatePublished - 2012

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science
  • Computer Science Applications
  • Geometry and Topology
  • Computational Theory and Mathematics


Dive into the research topics of 'Lombardi drawings of graphs'. Together they form a unique fingerprint.

Cite this