Delaunay and regular triangulations as lexicographic optimal chains

DOI10.1007/s00454-023-00485-1OpenAlexW4376638103MaRDI QIDQ6156086

André Lieutier, David Cohen-Steiner, Julien Vuillamy

Publication date: 12 June 2023

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-023-00485-1

zbMATH Keywords

Delaunayregular triangulationssimpliciallexicographicminimal chains

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Discrete geometry (52C99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient mesh optimization schemes based on optimal Delaunay triangulations
• Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\)
• Incremental topological flipping works for regular triangulations
• Lexicographic optimal homologous chains and applications to point cloud triangulations
• Revisiting Optimal Delaunay Triangulation for 3D Graded Mesh Generation
• Delaunay Mesh Generation
• Curvature Measures
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• Geometric and Topological Inference
• Convex Analysis

This page was built for publication: Delaunay and regular triangulations as lexicographic optimal chains