TY - GEN
T1 - Lombardi drawings of graphs
AU - Duncan, Christian A.
AU - Eppstein, David
AU - Goodrich, Michael T.
AU - Kobourov, Stephen G.
AU - Nöllenburg, Martin
PY - 2011
Y1 - 2011
N2 - 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 equally spaced around each vertex. We describe algorithms for finding Lombardi drawings of regular graphs, graphs of bounded degeneracy, and certain families of planar graphs.
AB - 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 equally spaced around each vertex. We describe algorithms for finding Lombardi drawings of regular graphs, graphs of bounded degeneracy, and certain families of planar graphs.
UR - http://www.scopus.com/inward/record.url?scp=79952270419&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79952270419&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-18469-7_18
DO - 10.1007/978-3-642-18469-7_18
M3 - Conference contribution
AN - SCOPUS:79952270419
SN - 9783642184680
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 195
EP - 207
BT - Graph Drawing - 18th International Symposium, GD 2010, Revised Selected Papers
T2 - 18th International Symposium on Graph Drawing, GD 2010
Y2 - 21 September 2010 through 24 September 2010
ER -