Generalizing CGAL Periodic Delaunay Triangulations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Generalizing CGAL Periodic Delaunay Triangulations


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.
Vignette du fichier
domain3d.jpg (52.42 Ko) Télécharger le fichier Fichier principal
Vignette du fichier
esa_final.pdf (696.27 Ko) Télécharger le fichier
slides-Generalizing CGAL Periodic Delaunay Triangulations.pdf (1.34 Mo) Télécharger le fichier
Format : Figure, Image
Origin : Files produced by the author(s)

Dates and versions

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



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⟩
128 View
161 Download



Gmail Facebook Twitter LinkedIn More