Delaunay and regular triangulations as lexicographic optimal chains
From MaRDI portal
(Redirected from Publication:6156086)
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
Cites work
- Convex Analysis
- Curvature Measures
- Delaunay mesh generation.
- Efficient mesh optimization schemes based on optimal Delaunay triangulations
- Geometric and topological inference
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- scientific article; zbMATH DE number 1220053 (Why is no real title available?)
- scientific article; zbMATH DE number 2066953 (Why is no real title available?)
- Incremental topological flipping works for regular triangulations
- Lexicographic optimal homologous chains and applications to point cloud triangulations
- Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\)
- Revisiting optimal Delaunay triangulation for 3D graded mesh generation
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
Cited in
(4)- scientific article; zbMATH DE number 7760161 (Why is no real title available?)
- Delaunay-like triangulation of smooth orientable submanifolds by _1-norm minimization
- Lexicographic optimal chains and critical bases
- Wrapping cycles in Delaunay complexes: bridging persistent homology and discrete Morse theory
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)
