Randomized graph drawing with heavy-duty preprocessing

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 acchieve on its own

Randomized Graph Drawing with Heavy-Duty Preprocessing

: 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..

An Incremental Drawing Algorithm for Planar Graphs

We present a new algorithm for drawing planar graphs on the plane. It can be viewed as a generalization of the algorithm of Chrobak and Payne, which in turn, is based on an algorithm by de Fraysseix, Pach and Pollack. Our algorithm improves the previous ones in that it does not require a preliminary triangulation step; triangulation proves problematic in drawing graphs ``nicely", as it has the tendency to ruin the structure of the input graph. The new algorithm retains the positive features of the previous algorithms: It embeds a graph of $n$ vertices on a grid of size $(2n-4)\times (n-2)$ in linear time. We have implemented the algorithm as part of a software system for drawing graphs nicely

Randomized graph drawing with heavy-duty preprocessing

Programme 2 : calcul symbolique, programmation et genie logicielSIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : 14802 E, issue : a.1993 n.2147 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc