Computer Science – Computational Geometry
Scientific paper
2010-09-03
J. Graph Algorithms and Applications 16(1):85-108, 2012 (special issue for GD 2010)
Computer Science
Computational Geometry
Expanded version of paper appearing in the 18th International Symposium on Graph Drawing (GD 2010). 13 pages, 7 figures
Scientific paper
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.
Duncan Christian A.
Eppstein David
Goodrich Michael T.
Kobourov Stephen G.
Nöllenburg Martin
No associations
LandOfFree
Lombardi Drawings of Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Lombardi Drawings of Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lombardi Drawings of Graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-684345