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. © 2012 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Duncan, C. A., Eppstein, D., Goodrich, M. T., Kobourov, S. G., & Löffler, M. (2012). Planar and poly-arc Lombardi drawings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7034 LNCS, pp. 308–319). https://doi.org/10.1007/978-3-642-25878-7_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
