Delaunay and regular triangulations as lexicographic optimal chains

DOI10.1007/S00454-023-00485-1OpenAlexW4376638103MaRDI QIDQ6156086FDOQ6156086

Authors: David Cohen-Steiner, A. Lieutier, 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

Recommendations

• Regular triangulations of dynamic sets of points
• scientific article; zbMATH DE number 1182915
• General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties
• Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\)
• scientific article; zbMATH DE number 1670662

zbMATH Keywords

regular triangulationsDelaunaysimpliciallexicographicminimal chains

Mathematics Subject Classification ID

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

Cites Work

• Curvature Measures
• Convex Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Incremental topological flipping works for regular triangulations
• Revisiting optimal Delaunay triangulation for 3D graded mesh generation
• Title not available (Why is that?)
• Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\)
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• Efficient mesh optimization schemes based on optimal Delaunay triangulations
• Delaunay mesh generation.
• Geometric and topological inference
• Lexicographic optimal homologous chains and applications to point cloud triangulations

Cited In (1)

• Title not available (Why is that?)

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

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