Covering spaces and Delaunay triangulations of the 2D flat torus
Résumé
A previous algorithm was computing the Delaunay triangulation of the flat torus, by using a 9-sheeted covering space. We propose a modification of the algorithm using only a 8-sheeted covering space, which allows to work with 8 periodic copies of the input points instead of 9. The main interest of our contribution is not only this result, but most of all the method itself: this new construction of covering spaces generalizes to Delaunay triangulations of surfaces of higher genus.
Domaines
Géométrie algorithmique [cs.CG]
Fichier principal
hal.pdf (142.6 Ko)
Télécharger le fichier
2-sh.png (16.93 Ko)
Télécharger le fichier
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
| Format | Figure, Image |
|---|---|
| Origine | Fichiers produits par l'(les) auteur(s) |
Loading...