On the usability of Lombardi graph drawings

Helen C. Purchase; John Hamer; Martin Nöllenburg; Stephen G. Kobourov

doi:10.1007/978-3-642-36763-2_40

On the usability of Lombardi graph drawings

Helen C. Purchase, John Hamer, Martin Nöllenburg, Stephen G. Kobourov

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

31 Citations (Scopus)

Abstract

A recent line of work in graph drawing studies Lombardi drawings, i.e., drawings with circular-arc edges and perfect angular resolution at vertices. Little is known about the effects of curved edges versus straight edges in typical graph reading tasks. In this paper we present the first user evaluation that empirically measures the readability of three different layout algorithms (traditional spring embedder and two recent near-Lombardi force-based algorithms) for three different tasks (shortest path, common neighbor, vertex degree). The results indicate that, while users prefer the Lombardi drawings, the performance data do not present such a positive picture.

Original language	English
Title of host publication	Graph Drawing - 20th International Symposium, GD 2012, Revised Selected Papers
Publisher	Springer
Pages	451-462
Number of pages	12
ISBN (Print)	9783642367625
DOIs	https://doi.org/10.1007/978-3-642-36763-2_40
Publication status	Published - 2013
Externally published	Yes
Event	Graph Drawing 2012 - Redmond, United States of America Duration: 19 Sept 2012 → 21 Sept 2012 Conference number: 20th https://link.springer.com/book/10.1007/978-3-642-36763-2 (Proceedings)

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7704 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	Graph Drawing 2012
Abbreviated title	GD 2012
Country/Territory	United States of America
City	Redmond
Period	19/09/12 → 21/09/12
Internet address	https://link.springer.com/book/10.1007/978-3-642-36763-2 (Proceedings)

Access to Document

10.1007/978-3-642-36763-2_40

Cite this

Purchase, H. C., Hamer, J., Nöllenburg, M., & Kobourov, S. G. (2013). On the usability of Lombardi graph drawings. In Graph Drawing - 20th International Symposium, GD 2012, Revised Selected Papers (pp. 451-462). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7704 LNCS). Springer. https://doi.org/10.1007/978-3-642-36763-2_40

@inproceedings{d1283f3622204b9e8d3095082b22725c,

title = "On the usability of Lombardi graph drawings",

abstract = "A recent line of work in graph drawing studies Lombardi drawings, i.e., drawings with circular-arc edges and perfect angular resolution at vertices. Little is known about the effects of curved edges versus straight edges in typical graph reading tasks. In this paper we present the first user evaluation that empirically measures the readability of three different layout algorithms (traditional spring embedder and two recent near-Lombardi force-based algorithms) for three different tasks (shortest path, common neighbor, vertex degree). The results indicate that, while users prefer the Lombardi drawings, the performance data do not present such a positive picture.",

author = "Purchase, {Helen C.} and John Hamer and Martin N{\"o}llenburg and Kobourov, {Stephen G.}",

year = "2013",

doi = "10.1007/978-3-642-36763-2_40",

language = "English",

isbn = "9783642367625",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "451--462",

booktitle = "Graph Drawing - 20th International Symposium, GD 2012, Revised Selected Papers",

note = "Graph Drawing 2012, GD 2012 ; Conference date: 19-09-2012 Through 21-09-2012",

url = "https://link.springer.com/book/10.1007/978-3-642-36763-2",

}

Purchase, HC, Hamer, J, Nöllenburg, M & Kobourov, SG 2013, On the usability of Lombardi graph drawings. in Graph Drawing - 20th International Symposium, GD 2012, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7704 LNCS, Springer, pp. 451-462, Graph Drawing 2012, Redmond, Washington, United States of America, 19/09/12. https://doi.org/10.1007/978-3-642-36763-2_40

On the usability of Lombardi graph drawings. / Purchase, Helen C.; Hamer, John; Nöllenburg, Martin et al.
Graph Drawing - 20th International Symposium, GD 2012, Revised Selected Papers. Springer, 2013. p. 451-462 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7704 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

T1 - On the usability of Lombardi graph drawings

AU - Purchase, Helen C.

AU - Hamer, John

AU - Nöllenburg, Martin

AU - Kobourov, Stephen G.

N1 - Conference code: 20th

PY - 2013

Y1 - 2013

N2 - A recent line of work in graph drawing studies Lombardi drawings, i.e., drawings with circular-arc edges and perfect angular resolution at vertices. Little is known about the effects of curved edges versus straight edges in typical graph reading tasks. In this paper we present the first user evaluation that empirically measures the readability of three different layout algorithms (traditional spring embedder and two recent near-Lombardi force-based algorithms) for three different tasks (shortest path, common neighbor, vertex degree). The results indicate that, while users prefer the Lombardi drawings, the performance data do not present such a positive picture.

AB - A recent line of work in graph drawing studies Lombardi drawings, i.e., drawings with circular-arc edges and perfect angular resolution at vertices. Little is known about the effects of curved edges versus straight edges in typical graph reading tasks. In this paper we present the first user evaluation that empirically measures the readability of three different layout algorithms (traditional spring embedder and two recent near-Lombardi force-based algorithms) for three different tasks (shortest path, common neighbor, vertex degree). The results indicate that, while users prefer the Lombardi drawings, the performance data do not present such a positive picture.

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

U2 - 10.1007/978-3-642-36763-2_40

DO - 10.1007/978-3-642-36763-2_40

M3 - Conference Paper

AN - SCOPUS:84874151944

SN - 9783642367625

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

SP - 451

EP - 462

BT - Graph Drawing - 20th International Symposium, GD 2012, Revised Selected Papers

PB - Springer

T2 - Graph Drawing 2012

Y2 - 19 September 2012 through 21 September 2012

ER -

Purchase HC, Hamer J, Nöllenburg M, Kobourov SG. On the usability of Lombardi graph drawings. In Graph Drawing - 20th International Symposium, GD 2012, Revised Selected Papers. Springer. 2013. p. 451-462. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-36763-2_40

On the usability of Lombardi graph drawings

Abstract

Publication series

Conference

Access to Document

Other files and links

Cite this