@TECHREPORT{Tunkelang94apractical, author = {Daniel Tunkelang}, title = {A Practical Approach to Drawing Undirected Graphs}, institution = {}, year = {1994} }

Years of Citing Articles

Bookmark

OpenURL

Abstract

Although there is extensive research on drawing graphs, none of the published methods are satisfactory for drawing general undirected graphs. Generating drawings which are optimal with respect to several aesthetic criteria is known to be NP-hard, so all published approaches to the problem have used heuristics. These heuristics are too slow to be practical for graphs of moderate size, and they do not produce consistently good drawings for general graphs. Moreover, they rely on general optimization methods, because problem-specific methods require a deeper theoretical understanding of the graph drawing problem. This paper presents an algorithm to generate two-dimensional drawings of undirected graphs. The algorithm uses a combination of heuristics to obtain drawings which are near-optimal with respect to an aesthetic cost function. The algorithm is incremental in nature, but preprocesses the graph to determine an order for node placement. The algorithm uses a local optimization strategy...