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.
Type de document :
Rapport
[Research Report] RR-2147, INRIA. 1993
Liste complète des métadonnées

https://hal.inria.fr/inria-00074525
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 15:40:35
Dernière modification le : samedi 27 janvier 2018 - 01:31:00
Document(s) archivé(s) le : mardi 12 avril 2011 - 17:21:50

Fichiers

Identifiants

  • 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〉

Partager

Métriques

Consultations de la notice

180

Téléchargements de fichiers

48