Lombardi drawings of graphs

Authors:
Christian A. Duncan;David Eppstein;Michael T. Goodrich;Stephen G. Kobourov;Martin Nöllenburg
Affiliations:
Department of Computer Science, Louisiana Tech. Univ., Ruston, Louisiana;Department of Computer Science, University of California, Irvine, California;Department of Computer Science, University of California, Irvine, California;Department of Computer Science, University of Arizona, Tucson, Arizona;Department of Computer Science, University of California, Irvine, California
Venue:
GD'10 Proceedings of the 18th international conference on Graph drawing
Year:
2010

Citing 15
Cited 7

Julius Petersen's theory of regular graphs

Discrete Mathematics - Special volume (part 1) to mark the centennial of Julius Petersen's “Die theorie der regula¨ren graphs”
On the Angular Resolution of Planar Graphs

SIAM Journal on Discrete Mathematics
Angles of Planar Triangular Graphs

SIAM Journal on Discrete Mathematics
Bipartite Edge Coloring in $O(\Delta m)$ Time

SIAM Journal on Computing
Near-optimal fully-dynamic graph connectivity

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Efficient algorithms for Petersen's matching theorem

Journal of Algorithms
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity

Journal of the ACM (JACM)
Planar Polyline Drawings with Good Angular Resolution

GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract)

ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
A simple algorithm for edge-coloring bipartite multigraphs

Information Processing Letters
Angle and distance constraints on tree drawings

GD'06 Proceedings of the 14th international conference on Graph drawing
Improved circular layouts

GD'06 Proceedings of the 14th international conference on Graph drawing
Drawing trees with perfect angular resolution and polynomial area

GD'10 Proceedings of the 18th international conference on Graph drawing
Curvilinear graph drawing using the force-directed method

GD'04 Proceedings of the 12th international conference on Graph Drawing
Crossing reduction in circular layouts

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science

Drawing trees with perfect angular resolution and polynomial area

GD'10 Proceedings of the 18th international conference on Graph drawing
Triangulations with circular arcs

GD'11 Proceedings of the 19th international conference on Graph Drawing
Planar and poly-arc lombardi drawings

GD'11 Proceedings of the 19th international conference on Graph Drawing
Force-Directed lombardi-style graph drawing

GD'11 Proceedings of the 19th international conference on Graph Drawing
Graph drawing contest report

GD'11 Proceedings of the 19th international conference on Graph Drawing
A user study on curved edges in graph visualisation

Diagrams'12 Proceedings of the 7th international conference on Diagrammatic Representation and Inference
Force-Directed graph drawing using social gravity and scaling

GD'12 Proceedings of the 20th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the notion of Lombardi graph drawings, named after the American abstract artistMark 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.