Skip to Main content Skip to Navigation
Reports

Randomized graph drawing with heavy-duty preprocessing

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 acchieve on its own.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00074525
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 3:40:35 PM
Last modification on : Thursday, October 15, 2020 - 2:42:03 PM
Long-term archiving on: : Tuesday, April 12, 2011 - 5:21:50 PM

Identifiers

  • HAL Id : inria-00074525, version 1

Collections

Citation

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

Share

Metrics

Record views

206

Files downloads

129