License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ESA.2020.75
URN: urn:nbn:de:0030-drops-129419
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/12941/
Osang, Georg ;
Rouxel-Labbé, Mael ;
Teillaud, Monique
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.
BibTeX - Entry
@InProceedings{osang_et_al:LIPIcs:2020:12941,
author = {Georg Osang and Mael Rouxel-Labb{\'e} and Monique Teillaud},
title = {{Generalizing CGAL Periodic Delaunay Triangulations}},
booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)},
pages = {75:1--75:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-162-7},
ISSN = {1868-8969},
year = {2020},
volume = {173},
editor = {Fabrizio Grandoni and Grzegorz Herman and Peter Sanders},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12941},
URN = {urn:nbn:de:0030-drops-129419},
doi = {10.4230/LIPIcs.ESA.2020.75},
annote = {Keywords: Delaunay triangulation, lattice, algorithm, software, experiments}
}
