Generalizing CGAL periodic Delaunay triangulations

Osang GF, Rouxel-Labbé M, Teillaud M. 2020. Generalizing CGAL periodic Delaunay triangulations. 28th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 173, 75.

Download
OA 2020_LIPIcs_Osang.pdf 733.29 KB [Published Version]

Conference Paper | Published | English

Scopus indexed
Author
Osang, Georg FISTA ; Rouxel-Labbé, Mael; Teillaud, Monique

Corresponding author has ISTA affiliation

Department
Series Title
LIPIcs
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.
Publishing Year
Date Published
2020-08-26
Proceedings Title
28th Annual European Symposium on Algorithms
Publisher
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Volume
173
Article Number
75
Conference
ESA: Annual European Symposium on Algorithms
Conference Location
Virtual, Online; Pisa, Italy
Conference Date
2020-09-07 – 2020-09-09
ISSN
IST-REx-ID

Cite this

Osang GF, Rouxel-Labbé M, Teillaud M. Generalizing CGAL periodic Delaunay triangulations. In: 28th Annual European Symposium on Algorithms. Vol 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.ESA.2020.75
Osang, G. F., Rouxel-Labbé, M., & Teillaud, M. (2020). Generalizing CGAL periodic Delaunay triangulations. In 28th Annual European Symposium on Algorithms (Vol. 173). Virtual, Online; Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2020.75
Osang, Georg F, Mael Rouxel-Labbé, and Monique Teillaud. “Generalizing CGAL Periodic Delaunay Triangulations.” In 28th Annual European Symposium on Algorithms, Vol. 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.ESA.2020.75.
G. F. Osang, M. Rouxel-Labbé, and M. Teillaud, “Generalizing CGAL periodic Delaunay triangulations,” in 28th Annual European Symposium on Algorithms, Virtual, Online; Pisa, Italy, 2020, vol. 173.
Osang GF, Rouxel-Labbé M, Teillaud M. 2020. Generalizing CGAL periodic Delaunay triangulations. 28th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 173, 75.
Osang, Georg F., et al. “Generalizing CGAL Periodic Delaunay Triangulations.” 28th Annual European Symposium on Algorithms, vol. 173, 75, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.ESA.2020.75.
All files available under the following license(s):
Main File(s)
File Name
Access Level
OA Open Access
Date Uploaded
2020-10-27
MD5 Checksum
fe0f7c49a99ed870c671b911e10d5496


Material in ISTA:
Dissertation containing ISTA record

Export

Marked Publications

Open Data ISTA Research Explorer

Search this title in

Google Scholar
ISBN Search