Fast spherical drawing of triangulations: an experimental study of graph drawing tools - Laboratoire d'informatique de l'X (LIX) Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Fast spherical drawing of triangulations: an experimental study of graph drawing tools

Résumé

We consider the problem of computing a spherical crossing-free geodesic drawing of a planar graph: this problem, as well as the closely related spherical parameterization problem, has attracted a lot of attention in the last two decades both in theory and in practice, motivated by a number of applications ranging from texture mapping to mesh remeshing and morphing. Our main concern is to design and implement a linear time algorithm for the computation of spherical drawings provided with theoretical guarantees. While not being aesthetically pleasing, our method is extremely fast and can be used as initial placer for spherical iterative methods and spring embedders. We provide experimental comparison with initial placers based on planar Tutte parameterization. Finally we explore the use of spherical drawings as initial layouts for (Euclidean) spring embedders: experimental evidence shows that this greatly helps to untangle the layout and to reach better local minima.
Fichier principal
Vignette du fichier
SphericalDrawing_Hal.pdf (16.4 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01761754 , version 1 (09-04-2018)

Identifiants

  • HAL Id : hal-01761754 , version 1

Citer

Luca Castelli Aleardi, Gaspard Denis, Eric Fusy. Fast spherical drawing of triangulations: an experimental study of graph drawing tools. 17th International Symposium on Experimental Algorithms, Jun 2018, L'Aquila, Italy. ⟨hal-01761754⟩
188 Consultations
38 Téléchargements

Partager

Gmail Facebook X LinkedIn More