Generalizing CGAL Periodic Delaunay Triangulations

DOI10.4230/LIPIcs.ESA.2020.75OpenAlexW3082227903MaRDI QIDQ5874547

Georg Osang, Mael Rouxel-Labbé, Monique Teillaud

Publication date: 7 February 2023

Full work available at URL: https://hal.inria.fr/hal-02923439

zbMATH Keywords

softwarelatticealgorithmexperimentsDelaunay triangulation

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Uses Software

• CGAL
• 3D triangulations
• 2D triangulations
• Voro++

Cites Work

• Unnamed Item
• Unnamed Item
• Delaunay triangulations of closed Euclidean \(d\)-orbifolds
• Perturbations for Delaunay and weighted Delaunay 3D triangulations
• Periodic Delone tilings
• A Deterministic Single Exponential Time Algorithm for Most Lattice Problems Based on Voronoi Cell Computations
• Finding the Closest Lattice Point by Iterative Slicing
• Low-dimensional lattices. VI. Voronoi reduction of three-dimensional lattices

This page was built for publication: Generalizing CGAL Periodic Delaunay Triangulations