Metrics for Graph Drawing Aesthetics

Author: Purchase H.C.

Source: Journal of Visual Languages & Computing, Volume 13, Number 5, October 2002 , pp. 501-516(16)

Buy & download fulltext article:

Price: $52.63 plus tax (Refund Policy)

Abstract:

Graph layout algorithms typically conform to one or more aesthetic criteria (e.g. minimizing the number of bends, maximizing orthogonality). Determining the extent to which a graph drawing conforms to an aesthetic criterion tends to be done informally, and varies between different algorithms. This paper presents formal metrics for measuring the aesthetic presence in a graph drawing for seven common aesthetic criteria, applicable to any graph drawing of any size. The metrics are useful for determining the aesthetic quality of a given graph drawing, or for defining a cost function for genetic algorithms or simulated annealing programs. The metrics are continuous, so that aesthetic quality is not stated as a binary conformance decision (i.e. the drawing either conforms to the aesthetic or not), but can be stated as the extent of aesthetic conformance using a number between 0 and 1. The paper presents the seven metric formulae. The application of these metrics is demonstrated through the aesthetic analysis of example graph drawings produced by common layout algorithms. Copyright 2002 Elsevier Science Ltd. All rights reserved.

Language: English

Document Type: Research article

DOI: http://dx.doi.org/10.1006/jvlc.2002.0232

Affiliations: School of Computer Science and Electrical Engineering, The University of Queensland, St. Lucia, Queensland, 4072, Australia

Publication date: 2002-10-01