Performance evaluation of graph drawing algorithms

Abstract

Recently, the development of computer technologies has been rapid and they have been applied in numerous fields. In graph drawing, for example, a picture composed of points and lines is used to represent a graph. In general, graph drawing results are evaluated in terms of ease of viewing. However, such evaluations are strongly dependent on individual taste and therefore are not yet fully satisfactory. In this paper, as a step toward the creation of a general standard of “ease of viewing,” we present a quantitative method of evaluating graph drawing performance. Two algorithms based on the spring model are quantitatively evaluated using drawn objects and revised versions of the algorithms are developed. © 1997 Scripta Technica, Inc. Electron Comm Jpn Pt 3, 80(6): 54–61, 1997