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

N1 - Copyright:
Copyright 2012 Elsevier B.V., All rights reserved.

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

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

SP - 320

EP - 331

BT - Graph Drawing - 19th International Symposium, GD 2011, Revised Selected Papers

T2 - 19th International Symposium on Graph Drawing, GD 2011

Y2 - 21 September 2011 through 23 September 2011

ER -