Randomized Graph Drawing with Heavy-Duty Preprocessing (1994)
| Venue: | In: AVI ’94: Proceedings of the Workshop on Advanced Visual Interfaces |
| Citations: | 14 - 1 self |
BibTeX
@ARTICLE{Harel94randomizedgraph,
author = {David Harel and Meir Sardas},
title = {Randomized Graph Drawing with Heavy-Duty Preprocessing},
journal = {In: AVI ’94: Proceedings of the Workshop on Advanced Visual Interfaces},
year = {1994},
volume = {6},
pages = {233--253}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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. 1 Introduction A large amount of work on the problem of graph layout has been carried out in recent years, resulting in a number of sophisticated and powerful algorithms. An extensive and detailed survey can be found in [BETT93]. Many of the approaches taken are limited to special cases of graphs, such as trees or planar graphs; others concentrate on special kinds of layouts, such as rectilinear grid drawings, or convex drawin...
