Force-directed Lombardi-style graph drawing

Roman Chernobelskiy, Kathryn I. Cunningham, Michael T. Goodrich, Stephen G Kobourov, Lowell Trott

Research output: Chapter in Book/Report/Conference proceedingConference contribution

27 Citations (Scopus)

Abstract

A Lombardi drawing of a graph is one in which vertices are represented as points, edges are represented as circular arcs between their endpoints, and every vertex has perfect angular resolution (equal angles between consecutive edges, as measured by the tangents to the circular arcs at the vertex). We describe two algorithms that create "Lombardi-style" drawings (which we also call near-Lombardi drawings), in which all edges are still circular arcs, but some vertices may not have perfect angular resolution. Both of these algorithms take a force-directed, spring-embedding approach, with one using forces at edge tangents to produce curved edges and the other using dummy vertices on edges for this purpose. As we show, these approaches produce near-Lombardi drawings, with one being slightly better at achieving near-perfect angular resolution and the other being slightly better at balancing edge placements.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages320-331
Number of pages12
Volume7034 LNCS
DOIs
StatePublished - 2012
Event19th International Symposium on Graph Drawing, GD 2011 - Eindhoven, Netherlands
Duration: Sep 21 2011Sep 23 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7034 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other19th International Symposium on Graph Drawing, GD 2011
CountryNetherlands
CityEindhoven
Period9/21/119/23/11

Fingerprint

Graph Drawing
Arc of a curve
Tangent line
Vertex of a graph
Balancing
Placement
Consecutive
Angle
Drawing
Style
Graph in graph theory

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Chernobelskiy, R., Cunningham, K. I., Goodrich, M. T., Kobourov, S. G., & Trott, L. (2012). Force-directed Lombardi-style graph drawing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7034 LNCS, pp. 320-331). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7034 LNCS). https://doi.org/10.1007/978-3-642-25878-7_31

Force-directed Lombardi-style graph drawing. / Chernobelskiy, Roman; Cunningham, Kathryn I.; Goodrich, Michael T.; Kobourov, Stephen G; Trott, Lowell.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7034 LNCS 2012. p. 320-331 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7034 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chernobelskiy, R, Cunningham, KI, Goodrich, MT, Kobourov, SG & Trott, L 2012, Force-directed Lombardi-style graph drawing. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 7034 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7034 LNCS, pp. 320-331, 19th International Symposium on Graph Drawing, GD 2011, Eindhoven, Netherlands, 9/21/11. https://doi.org/10.1007/978-3-642-25878-7_31
Chernobelskiy R, Cunningham KI, Goodrich MT, Kobourov SG, Trott L. Force-directed Lombardi-style graph drawing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7034 LNCS. 2012. p. 320-331. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-25878-7_31
Chernobelskiy, Roman ; Cunningham, Kathryn I. ; Goodrich, Michael T. ; Kobourov, Stephen G ; Trott, Lowell. / Force-directed Lombardi-style graph drawing. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7034 LNCS 2012. pp. 320-331 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{ef98d303d82e4c5ab75c18f8d2c1afb2,
title = "Force-directed Lombardi-style graph drawing",
abstract = "A Lombardi drawing of a graph is one in which vertices are represented as points, edges are represented as circular arcs between their endpoints, and every vertex has perfect angular resolution (equal angles between consecutive edges, as measured by the tangents to the circular arcs at the vertex). We describe two algorithms that create {"}Lombardi-style{"} drawings (which we also call near-Lombardi drawings), in which all edges are still circular arcs, but some vertices may not have perfect angular resolution. Both of these algorithms take a force-directed, spring-embedding approach, with one using forces at edge tangents to produce curved edges and the other using dummy vertices on edges for this purpose. As we show, these approaches produce near-Lombardi drawings, with one being slightly better at achieving near-perfect angular resolution and the other being slightly better at balancing edge placements.",
author = "Roman Chernobelskiy and Cunningham, {Kathryn I.} and Goodrich, {Michael T.} and Kobourov, {Stephen G} and Lowell Trott",
year = "2012",
doi = "10.1007/978-3-642-25878-7_31",
language = "English (US)",
isbn = "9783642258770",
volume = "7034 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "320--331",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Force-directed Lombardi-style graph drawing

AU - Chernobelskiy, Roman

AU - Cunningham, Kathryn I.

AU - Goodrich, Michael T.

AU - Kobourov, Stephen G

AU - Trott, Lowell

PY - 2012

Y1 - 2012

N2 - A Lombardi drawing of a graph is one in which vertices are represented as points, edges are represented as circular arcs between their endpoints, and every vertex has perfect angular resolution (equal angles between consecutive edges, as measured by the tangents to the circular arcs at the vertex). We describe two algorithms that create "Lombardi-style" drawings (which we also call near-Lombardi drawings), in which all edges are still circular arcs, but some vertices may not have perfect angular resolution. Both of these algorithms take a force-directed, spring-embedding approach, with one using forces at edge tangents to produce curved edges and the other using dummy vertices on edges for this purpose. As we show, these approaches produce near-Lombardi drawings, with one being slightly better at achieving near-perfect angular resolution and the other being slightly better at balancing edge placements.

AB - A Lombardi drawing of a graph is one in which vertices are represented as points, edges are represented as circular arcs between their endpoints, and every vertex has perfect angular resolution (equal angles between consecutive edges, as measured by the tangents to the circular arcs at the vertex). We describe two algorithms that create "Lombardi-style" drawings (which we also call near-Lombardi drawings), in which all edges are still circular arcs, but some vertices may not have perfect angular resolution. Both of these algorithms take a force-directed, spring-embedding approach, with one using forces at edge tangents to produce curved edges and the other using dummy vertices on edges for this purpose. As we show, these approaches produce near-Lombardi drawings, with one being slightly better at achieving near-perfect angular resolution and the other being slightly better at balancing edge placements.

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

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

U2 - 10.1007/978-3-642-25878-7_31

DO - 10.1007/978-3-642-25878-7_31

M3 - Conference contribution

AN - SCOPUS:84455189561

SN - 9783642258770

VL - 7034 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 320

EP - 331

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -