On the usability of lombardi graph drawings

  • Authors:

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

  • Affiliations:

  • School of Computing Science, University of Glasgow, Glasgow, UK;School of Computing Science, University of Glasgow, Glasgow, UK;Faculty of Informatics, Karlsruhe Institute of Technology, Karlsruhe, Germany;Department of Computer Science, University of Arizona, Tucson, AZ

  • Venue:
  • GD'12 Proceedings of the 20th international conference on Graph Drawing
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

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.