Planar and Poly-Arc Lombardi Drawings
Christian A. Duncan, David Eppstein, Michael T. Goodrich and, Stephen G. Kobourov, Maarten L\"offler

TL;DR
This paper introduces k-Lombardi drawings, allowing edges to be composed of multiple arcs, and proves that every planar graph admits a smooth planar 3-Lombardi drawing, expanding the understanding of Lombardi graph representations.
Contribution
It extends Lombardi drawings to k-Lombardi drawings and establishes that all planar graphs can be represented with smooth planar 3-Lombardi drawings.
Findings
Every graph has a smooth 2-Lombardi drawing.
Every planar graph has a smooth planar 3-Lombardi drawing.
Explores the relationship between planarity and Lombardi drawings.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
