TY - GEN
T1 - Planar and poly-arc Lombardi drawings
AU - Duncan, Christian A.
AU - Eppstein, David
AU - Goodrich, Michael T.
AU - Kobourov, Stephen G.
AU - Löffler, Maarten
PY - 2012
Y1 - 2012
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/84455181552
UR - https://www.scopus.com/pages/publications/84455181552#tab=citedBy
U2 - 10.1007/978-3-642-25878-7_30
DO - 10.1007/978-3-642-25878-7_30
M3 - Conference contribution
AN - SCOPUS:84455181552
SN - 9783642258770
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 308
EP - 319
BT - Graph Drawing - 19th International Symposium, GD 2011, Revised Selected Papers
T2 - 19th International Symposium on Graph Drawing, GD 2011
Y2 - 21 September 2011 through 23 September 2011
ER -