pith. sign in

arxiv: 1109.0345 · v1 · pith:NWYIZDONnew · submitted 2011-09-02 · 💻 cs.CG · cs.DM

Planar and Poly-Arc Lombardi Drawings

classification 💻 cs.CG cs.DM
keywords lombardiplanardrawingdrawingseverygrapharcscircular
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.