DMCA
Metrics for Graph Drawing Aesthetics (2001)
| Venue: | AUSTRALIAN COMPUTER SOCIETY |
| Citations: | 101 - 3 self |
BibTeX
@INPROCEEDINGS{Purchase01metricsfor,
author = {Helen C. Purchase},
title = {Metrics for Graph Drawing Aesthetics },
booktitle = {AUSTRALIAN COMPUTER SOCIETY},
year = {2001},
pages = {129--137},
publisher = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Graph layout algorithms typically conform to one or more aesthetic criteria (e.g. minimising the number of bends, maximising 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.
Keyphrases
graph drawing aesthetic aesthetic quality aesthetic criterion aesthetic conformance aesthetic presence common layout algorithm annealing program genetic algorithm formal metric graph drawing example graph drawing binary conformance decision common aesthetic criterion different algorithm aesthetic analysis graph layout algorithm cost function metric formula
