Conforming Delaunay triangulations in 3D

DOI10.1016/j.comgeo.2004.03.001zbMath1054.65018OpenAlexW4213122280MaRDI QIDQ598238

David Cohen-Steiner, Mariette Yvinec, Éric Colin de Verdière

Publication date: 6 August 2004

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00072243/file/RR-4345.pdf

zbMATH Keywords

algorithmsconforming Delaunay triangulationpiecewise linear complexSteine points

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

A generic software design for Delaunay refinement meshing, Delaunay meshing of piecewise smooth complexes without expensive predicates, Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains, DELAUNAY REFINEMENT ALGORITHMS FOR ESTIMATING LOCAL FEATURE SIZE IN 2D AND 3D, Boundary recovery after 3D Delaunay tetrahedralization without adding extra nodes, Practical unstructured splines: algorithms, multi-patch spline spaces, and some applications to numerical analysis, TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator

Cites Work

• An upper bound for conforming Delaunay triangulations
• A POINT-PLACEMENT STRATEGY FOR CONFORMING DELAUNAY TETRAHEDRALIZATION
• A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
• Unnamed Item