Abstract
We introduce the notion of Lombardi graph drawings, named after the American abstract artist Mark Lombardi. In these drawings, edges are represented as circular arcs rather than as line segments or polylines, and the vertices have perfect angular resolution: the edges are equally spaced around each vertex. We describe algorithms for finding Lombardi drawings of regular graphs, graphs of bounded degeneracy, and certain families of planar graphs. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Duncan, C. A., Eppstein, D., Goodrich, M. T., Kobourov, S. G., & Nöllenburg, M. (2011). Lombardi drawings of graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6502 LNCS, pp. 195–207). https://doi.org/10.1007/978-3-642-18469-7_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
