Randomized graph drawing with heavy-duty preprocessing - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1993

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.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-2147.pdf (1.15 Mo) Télécharger le fichier

Dates and versions

inria-00074525 , version 1 (24-05-2006)


  • HAL Id : inria-00074525 , version 1


David Harel, Meir Sardas. Randomized graph drawing with heavy-duty preprocessing. [Research Report] RR-2147, INRIA. 1993. ⟨inria-00074525⟩
118 View
68 Download


Gmail Facebook Twitter LinkedIn More