Generalizing CGAL Periodic Delaunay Triangulations - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

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.
Fichier principal
Vignette du fichier
esa_final.pdf (696.27 Ko) Télécharger le fichier
Vignette du 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...

Dates et versions

hal-02923439 , version 1 (27-08-2020)

Identifiants

Citer

Georg Osang, Mael Rouxel-Labbé, Monique Teillaud. Generalizing CGAL Periodic Delaunay Triangulations. ALGO 2020 - 28th European Symposium on Algorithms, Sep 2020, Pise / Virtual, Italy. pp.75:1--75:17, ⟨10.4230/LIPIcs.ESA.2020.75⟩. ⟨hal-02923439⟩
144 Consultations
204 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More