ε-Net Algorithm Implementation on Hyperbolic Surfaces
Résumé
We propose an implementation, using the CGAL library, of an algorithm to compute ε-nets on hyperbolic surfaces proposed by Despré, Lanuel and Teillaud [DLT24]. We describe the data structure, detail the implemented algorithm and report experimental results on hyperbolic surfaces of genus 2.
The implementation differs from the cited algorithm on several aspects. In particular, we use a different data structure, using a combinatorial map, to represent a triangulation of a surface. Also for the critical step of locating points on the surface, we use the visibility walk and prove its termination in the hyperbolic setting.
Fichier principal
implementation_epsilon_net_version_hal.pdf (1.38 Mo)
Télécharger le fichier
eps_net_123_01.pdf (86.13 Ko)
Télécharger le fichier
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
| Format | Figure, Image |
|---|