Journal of Graph Algorithms and Applications
|Home||Issues||Aims and Scope||Instructions for Authors|
Special Issue on Selected Papers from the Eighteenth International Symposium on Graph Drawing, GD 2010
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.
Submitted: December 2010.
Reviewed: July 2011.
Revised: August 2011.
Accepted: August 2011.
Final: September 2011.
Published: January 2012.