An experimental comparison of four graph drawing algorithms
Giuseppe Di Battista,Ashim Garg,Giuseppe Liotta,Roberto Tamassia,Emanuele Tassinari,Francesco Vargiu +5 more
204
TL;DR: An extensive experimental study comparing four general-purpose graph drawing algorithms, which take as input general graphs and construct orthogonal grid drawings, which are widely used in software and database visualization applications.
read more
Abstract: In this paper we present an extensive experimental study comparing four general-purpose graph drawing algorithms. The four algorithms take as input general graphs (with no restrictions whatsoever on connectivity, planarity, etc.) and construct orthogonal grid drawings, which are widely used in software and database visualization applications. The test data (available by anonymous ftp) are 11,582 graphs, ranging from 10 to 100 vertices, which have been generated from a core set of 112 graphs used in “real-life” software engineering and database applications. The experiments provide a detailed quantitative evaluation of the performance of the four algorithms, and show that they exhibit trade-offs between “aesthetic” properties (e.g., crossings, bends, edge length) and running time.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Layer-free upward crossing minimization
TL;DR: This article presents a new approach for upward crossing minimization, that is, finding an upward drawing of a DAG G with as few crossings as possible, based on a two-stage upward planarization approach, which computes a feasible downward planar subgraph in the first step and reinserts the remaining arcs by computing constraint-feasible upward insertion paths.
34
Drawing directed acyclic graphs: an experimental study
Giuseppe Di Battista,Ashim Garg,Giuseppe Liotta,Armando Parise,Roberto Tamassia,Emanuele Tassinari,Francesco Vargiu,Luca Vismara +7 more
TL;DR: The results of a comparative study on four popular drawing algorithms specifically developed for them are presented, and a new hybrid strategy for drawing DAGs is developed that performs quite well in practice.
34
Evaluating overall quality of graph visualizations based on aesthetics aggregation
TL;DR: A measurement that measures overall quality based on individual aesthetics and gives a single numerical score is proposed and a user study is presented that validates this measure by demonstrating its sensibility in detecting quality changes and its capacity in predicting the performance of human graph comprehension.
34
A unified approach to automatic label placement
TL;DR: This paper presents a general framework for solving the problem of assigning text or symbol labels to a set of graphical features in two dimensional drawings or maps, and presents a fast and simple technique for assigning labels to edges of graph drawings.
32
Interactive orthogonal graph drawing
A. Papakostas,Ioannis G. Tollis +1 more
TL;DR: In this article, the authors discuss features that are essential for an interactive orthogonal graph drawing system, and describe some possible interactive drawing scenarios, present results on two of them, and compare their performance.
32
References
Graph drawing by force-directed placement
TL;DR: A modification of the spring‐embedder model of Eades for drawing undirected graphs with straight edges is presented, developed in analogy to forces in natural systems, for a simple, elegant, conceptually‐intuitive, and efficient algorithm.
Methods for Visual Understanding of Hierarchical System Structures
Kozo Sugiyama,Shojiro Tagawa,Mitsuhiko Toda +2 more
- 01 Feb 1981
TL;DR: Two kinds of new methods are developed to obtain effective representations of hierarchies automatically: theoretical and heuristic methods that determine the positions of vertices in two steps to improve the readability of drawings.
1.4K
Efficient Planarity Testing
TL;DR: An efficient algorithm to determine whether an arbitrary graph G can be embedded in the plane is described, which used depth-first search and has time and space bounds.
How to Draw a Graph
TL;DR: In this paper, the authors define nodally 3-connected graphs as simple and non-separable graphs, and show how to obtain a convex representation of such graphs without Kuratowski subgraphs.