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

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

32 Scopus citations

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 (US)
Title of host publication	Graph Drawing - 20th International Symposium, GD 2012, Revised Selected Papers
Pages	451-462
Number of pages	12
DOIs	https://doi.org/10.1007/978-3-642-36763-2_40
State	Published - 2013
Event	20th International Symposium on Graph Drawing, GD 2012 - Redmond, WA, United States Duration: Sep 19 2012 → Sep 21 2012

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

Other

Other	20th International Symposium on Graph Drawing, GD 2012
Country/Territory	United States
City	Redmond, WA
Period	9/19/12 → 9/21/12

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

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). 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. 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 contribution

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, pp. 451-462, 20th International Symposium on Graph Drawing, GD 2012, Redmond, WA, United States, 9/19/12. https://doi.org/10.1007/978-3-642-36763-2_40

@inproceedings{0093d79cf3364f66af47d53a51f1537d,

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 (US)",

isbn = "9783642367625",

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

pages = "451--462",

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

note = "20th International Symposium on Graph Drawing, GD 2012 ; Conference date: 19-09-2012 Through 21-09-2012",

}

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.

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

UR - http://www.scopus.com/inward/citedby.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 contribution

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

T2 - 20th International Symposium on Graph Drawing, GD 2012

Y2 - 19 September 2012 through 21 September 2012

ER -

On the usability of Lombardi graph drawings

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this