<XML><RECORDS><RECORD><REFERENCE_TYPE>0</REFERENCE_TYPE><REFNUM>6621</REFNUM><AUTHORS><AUTHOR>Purchase,H.C.</AUTHOR></AUTHORS><YEAR>2002</YEAR><TITLE>Metrics for Graph Drawing Aesthetics</TITLE><PLACE_PUBLISHED>Journal of Visual Languages and Computing, 13(5), 2002.</PLACE_PUBLISHED><PUBLISHER>N/A</PUBLISHER><PAGES>501-516</PAGES><LABEL>Purchase:2002:6621</LABEL><KEYWORDS><KEYWORD>graph drawings</KEYWORD></KEYWORDS<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</ABSTRACT></RECORD></RECORDS></XML>