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 language | English (US) |
|---|---|
| Pages (from-to) | 85-108 |
| Number of pages | 24 |
| Journal | Journal of Graph Algorithms and Applications |
| Volume | 16 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jan 1 2012 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)
- Computer Science Applications
- Geometry and Topology
- Computational Theory and Mathematics
Fingerprint Dive into the research topics of 'Lombardi drawings of graphs'. Together they form a unique fingerprint.
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