Lombardi drawings of graphs

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

doi:10.7155/jgaa.00251

Lombardi drawings of graphs

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

Computer Science

Research output: Contribution to journal › Article › peer-review

29 Scopus citations

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 language	English (US)
Pages (from-to)	85-108
Number of pages	24
Journal	Journal of Graph Algorithms and Applications
Volume	16
Issue number	1
DOIs	https://doi.org/10.7155/jgaa.00251
State	Published - 2012

ASJC Scopus subject areas

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

Access to Document

10.7155/jgaa.00251

Fingerprint Dive into the research topics of 'Lombardi drawings of graphs'. Together they form a unique fingerprint.

Cite this

@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",

doi = "10.7155/jgaa.00251",

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

U2 - 10.7155/jgaa.00251

DO - 10.7155/jgaa.00251

M3 - Article

AN - SCOPUS:84856802791

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 -