Generalizing CGAL Periodic Delaunay Triangulations
Résumé
Even though Delaunay originally introduced his famous triangulations in the case of infinite point sets with translational periodicity, a software that computes such triangulations in the general case is not yet available, to the best of our knowledge. Combining and generalizing previous work, we present a practical algorithm for computing such triangulations. The algorithm has been implemented and experiments show that its performance is as good as the one of the CGAL package, which is restricted to cubic periodicity.
Domaines
Géométrie algorithmique [cs.CG]
Fichier principal
esa_final.pdf (696.27 Ko)
Télécharger le fichier
domain3d.jpg (52.42 Ko)
Télécharger le fichier
slides-Generalizing CGAL Periodic Delaunay Triangulations.pdf (1.34 Mo)
Télécharger le fichier
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
| Format | Figure, Image |
|---|
Loading...