Metrics for graph drawing aesthetics
Metrics for graph drawing aesthetics
复制标题
DOI：
10.1006/s1045-926x(02)00016-2
复制
发表时间：
2002-10-01
影响因子：
--
通讯作者：
Purchase, HC
中科院分区：
文献类型：
--
作者：
Purchase, HC
图形布局算法通常符合一个或多个美学标准（例如，最小化弯曲数量、最大化正交性）。确定图形绘制符合美学标准的程度往往是非正式的，并且在不同的算法之间有所不同。本文提出了正式的度量标准，用于测量的美学存在的七个常见的美学标准，适用于任何图形绘制的任何大小的图形。这些度量对于确定给定图形绘制的美学质量或用于定义遗传算法或模拟退火程序的成本函数是有用的。这些指标是连续的，因此美学质量不是以二元一致性决定（即图纸是否符合美学要求）来表示，而是可以使用0到1之间的数字来表示美学一致性的程度。本文给出了七个度量公式。通过对常见布局算法生成的示例图形进行美学分析，证明了这些指标的应用。(C)2002爱思唯尔科技有限公司。保留所有权利。
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. (C) 2002 Elsevier Science Ltd. All rights reserved.