Randomized graph drawing with heavy-duty preprocessing

Authors:
David Harel;Meir Sardas
Affiliations:
Dept. of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, Israel and INRIA, Sophia Antipolis;Dept. of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, Israel
Venue:
AVI '94 Proceedings of the workshop on Advanced visual interfaces
Year:
1994

Citing 6
Cited 2

A linear algorithm for embedding planar graphs using PQ-trees

Journal of Computer and System Sciences
On visual formalisms

Communications of the ACM
Simulated annealing: theory and applications

Simulated annealing: theory and applications
Small sets supporting fary embeddings of planar graphs

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
An algorithm for drawing general undirected graphs

Information Processing Letters
Graphs and Hypergraphs

Graphs and Hypergraphs

Inserting an edge into a planar graph

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Integrating edge routing into force-directed layout

GD'06 Proceedings of the 14th international conference on Graph drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a graph drawing system for general undirected graphs with straight-line edges. It carries out a rather complex set of preprocessing steps, designed to produce a topologically good, but not necessarily nice-looking layout, which is then subjected to Davidson and Harel's simulated annealing beautification algorithm. The intermediate layout is planar for planar graphs and attempts to come close to planar for nonplanar graphs. The system's results are significantly better, and much faster, than what the annealing approach is able to achieve on its own.