Generalizing CGAL Periodic Delaunay Triangulations

DOI10.4230/LIPICS.ESA.2020.75OpenAlexW3082227903MaRDI QIDQ5874547FDOQ5874547

Authors: Georg Osang, Mael Rouxel-Labbé, Monique Teillaud 

Publication date: 7 February 2023

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

Recommendations

• Generalized Delaunay triangulation for planar graphs
• Generalized Delaunay triangulations of non-convex domains
• Fast and robust Delaunay tessellation in periodic domains
• Almost regular Delaunay-triangulations
• scientific article
• Generalized triangulations
• Delaunay triangulations of generalized Bolza surfaces
• General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties
• General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties
• Publication:2753939

zbMATH Keywords

latticesoftwarealgorithmDelaunay triangulationexperiments

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Low-dimensional lattices. VI. Voronoi reduction of three-dimensional lattices
• Periodic Delone tilings
• A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
• Delaunay triangulations of closed Euclidean \(d\)-orbifolds
• Perturbations for Delaunay and weighted Delaunay 3D triangulations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finding the closest lattice point by iterative slicing

Cited In (3)

• Representing infinite periodic hyperbolic Delaunay triangulations using finitely many Dirichlet domains
• Generalized Delaunay triangulation for planar graphs
• Fast and robust Delaunay tessellation in periodic domains

Uses Software

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874547)