2026-07-23T13:57:49Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:12941 2024-03-06T10:51:08Z ddc:004 open_access

Generalizing CGAL Periodic Delaunay Triangulations Osang, Georg Rouxel-Labbé, Mael Teillaud, Monique Delaunay triangulation lattice algorithm software experiments 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Georg Osang and Mael Rouxel-Labbé and Monique Teillaud 2020 Is Part Of LIPIcs, Volume 173, 28th Annual European Symposium on Algorithms (ESA 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ESA.2020.75 urn:nbn:de:0030-drops-129419 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.75 eng https://creativecommons.org/licenses/by/3.0/legalcode