Lombardi Drawings of Graphs
Computational Geometry
2011-12-20 v1
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.
Keywords
Cite
@article{arxiv.1009.0579,
title = {Lombardi Drawings of Graphs},
author = {Christian A. Duncan and David Eppstein and Michael T. Goodrich and Stephen G. Kobourov and Martin Nöllenburg},
journal= {arXiv preprint arXiv:1009.0579},
year = {2011}
}
Comments
Expanded version of paper appearing in the 18th International Symposium on Graph Drawing (GD 2010). 13 pages, 7 figures