Journal of Graph Algorithms and Applications
http://jgaa.info ISSN: 1526-1719
|
DOI: 10.7155/jgaa.00251 Lombardi Drawings of Graphs Christian A. Duncan , David Eppstein , Michael T. Goodrich , Stephen G. Kobourov , and Martin Nöllenburg Vol. 16, no. 1, pp. 85-108, 2012. Regular paper 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 finding Lombardi drawings of regular graphs, graphs of bounded degeneracy, and certain families of planar graphs. |
Revised: August 2011. Reviewed: July 2011. Published: January 2012. Accepted: August 2011. Submitted: December 2010. Final: September 2011. Communicated by Ulrik Brandes and Sabine Cornelsen |
| Journal of Graph Algorithms and Applications |