Skip to Main content Skip to Navigation
Conference papers

Generalizing CGAL Periodic Delaunay Triangulations

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download


https://hal.inria.fr/hal-02923439
Contributor : Monique Teillaud <>
Submitted on : Thursday, August 27, 2020 - 10:23:14 AM
Last modification on : Friday, January 29, 2021 - 11:23:29 AM
Long-term archiving on: : Saturday, November 28, 2020 - 1:11:51 PM

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

102

Files downloads

271