Lombardi drawings of graphs

Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G Kobourov, Martin Nöllenburg

Research output: Contribution to journalArticle

26 Citations (Scopus)

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 equiangularly spaced around each vertex. We describe algorithms for _nding Lombardi drawings of regular graphs, graphs of bounded degeneracy, and certain families of planar graphs.

Original languageEnglish (US)
Pages (from-to)85-108
Number of pages24
JournalJournal of Graph Algorithms and Applications
Volume16
Issue number1
StatePublished - 2012

Fingerprint

Graph Drawing
Graph in graph theory
Line segment
Regular Graph
Degeneracy
Planar graph
Arc of a curve
Vertex of a graph
Drawing
Family

ASJC Scopus subject areas

  • Geometry and Topology
  • Theoretical Computer Science
  • Computational Theory and Mathematics
  • Computer Science(all)
  • Computer Science Applications

Cite this

Duncan, C. A., Eppstein, D., Goodrich, M. T., Kobourov, S. G., & Nöllenburg, M. (2012). Lombardi drawings of graphs. Journal of Graph Algorithms and Applications, 16(1), 85-108.

Lombardi drawings of graphs. / Duncan, Christian A.; Eppstein, David; Goodrich, Michael T.; Kobourov, Stephen G; Nöllenburg, Martin.

In: Journal of Graph Algorithms and Applications, Vol. 16, No. 1, 2012, p. 85-108.

Research output: Contribution to journalArticle

Duncan, CA, Eppstein, D, Goodrich, MT, Kobourov, SG & Nöllenburg, M 2012, 'Lombardi drawings of graphs', Journal of Graph Algorithms and Applications, vol. 16, no. 1, pp. 85-108.
Duncan CA, Eppstein D, Goodrich MT, Kobourov SG, Nöllenburg M. Lombardi drawings of graphs. Journal of Graph Algorithms and Applications. 2012;16(1):85-108.
Duncan, Christian A. ; Eppstein, David ; Goodrich, Michael T. ; Kobourov, Stephen G ; Nöllenburg, Martin. / Lombardi drawings of graphs. In: Journal of Graph Algorithms and Applications. 2012 ; Vol. 16, No. 1. pp. 85-108.
@article{c9df28bebaee475e9f8ffb2fdc617d77,
title = "Lombardi drawings of graphs",
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 equiangularly spaced around each vertex. We describe algorithms for _nding Lombardi drawings of regular graphs, graphs of bounded degeneracy, and certain families of planar graphs.",
author = "Duncan, {Christian A.} and David Eppstein and Goodrich, {Michael T.} and Kobourov, {Stephen G} and Martin N{\"o}llenburg",
year = "2012",
language = "English (US)",
volume = "16",
pages = "85--108",
journal = "Journal of Graph Algorithms and Applications",
issn = "1526-1719",
publisher = "Brown University",
number = "1",

}

TY - JOUR

T1 - Lombardi drawings of graphs

AU - Duncan, Christian A.

AU - Eppstein, David

AU - Goodrich, Michael T.

AU - Kobourov, Stephen G

AU - Nöllenburg, Martin

PY - 2012

Y1 - 2012

N2 - 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 equiangularly spaced around each vertex. We describe algorithms for _nding Lombardi drawings of regular graphs, graphs of bounded degeneracy, and certain families of planar graphs.

AB - 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 equiangularly spaced around each vertex. We describe algorithms for _nding Lombardi drawings of regular graphs, graphs of bounded degeneracy, and certain families of planar graphs.

UR - http://www.scopus.com/inward/record.url?scp=84856802791&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84856802791&partnerID=8YFLogxK

M3 - Article

VL - 16

SP - 85

EP - 108

JO - Journal of Graph Algorithms and Applications

JF - Journal of Graph Algorithms and Applications

SN - 1526-1719

IS - 1

ER -