Computer Science – Computational Geometry
Scientific paper
2011-09-02
Computer Science
Computational Geometry
Expanded version of paper appearing in the 19th International Symposium on Graph Drawing (GD 2011). 16 pages, 8 figures
Scientific paper
In Lombardi drawings of graphs, edges are represented as circular arcs, and the edges incident on vertices have perfect angular resolution. However, not every graph has a Lombardi drawing, and not every planar graph has a planar Lombardi drawing. We introduce k-Lombardi drawings, in which each edge may be drawn with k circular arcs, noting that every graph has a smooth 2-Lombardi drawing. We show that every planar graph has a smooth planar 3-Lombardi drawing and further investigate topics connecting planarity and Lombardi drawings.
Duncan Christian A.
Eppstein David
Goodrich Michael T.
Kobourov Stephen G.
Löffler Maarten
No associations
LandOfFree
Planar and Poly-Arc Lombardi Drawings 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 Planar and Poly-Arc Lombardi Drawings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Planar and Poly-Arc Lombardi Drawings will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-687388