Conforming Delaunay triangulations in 3D

DOI10.1016/J.COMGEO.2004.03.001MaRDI QIDQ598238zbMATH OpenOpenAlexFDO

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

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)

Review text

The authors present an algorithm to construct a Delaunay triangulation for a generated piecewise linear complex in three-dimensional space. The implementation shows that a relatively small number of Steine points are generated by the algorithm.

Recommendations

• Conforming Delaunay triangulations in 3D
• A POINT-PLACEMENT STRATEGY FOR CONFORMING DELAUNAY TETRAHEDRALIZATION
• Publication:4952602
• Delaunay-admissibilité des triangulations de surfaces
• Three-Dimensional Triangulations from Local Transformations

Cites work

• A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
• A POINT-PLACEMENT STRATEGY FOR CONFORMING DELAUNAY TETRAHEDRALIZATION
• An upper bound for conforming Delaunay triangulations
• scientific article; zbMATH DE number 1220053 (Why is no real title available?)

Cited in

(24)

• Delaunay triangulations in three dimensions with finite precision arithmetic
• Approximating constrained tetrahedrizations
• Delaunay meshing of piecewise smooth complexes without expensive predicates
• Practical unstructured splines: algorithms, multi-patch spline spaces, and some applications to numerical analysis
• A generic software design for Delaunay refinement meshing
• Boundary recovery after 3D Delaunay tetrahedralization without adding extra nodes
• Delaunay-admissibilité des triangulations de surfaces
• Aspects of three‐dimensional constrained Delaunay meshing
• A Robust Implementation for Three-Dimensional Delaunay Triangulations
• Conforming Delaunay triangulations in 3D
• A POINT-PLACEMENT STRATEGY FOR CONFORMING DELAUNAY TETRAHEDRALIZATION
• Three-Dimensional Triangulations from Local Transformations
• OUTPUT SENSITIVE CONSTRUCTION OF THE DELAUNAY TRIANGULATION OF POINTS LYING IN TWO PLANES
• scientific article; zbMATH DE number 1445289 (Why is no real title available?)
• Conforming discrete Gradgrad-complexes in three dimensions
• 3D kinetic alpha complexes and their implementation
• TetGen, a Delaunay-based quality tetrahedral mesh generator
• DELAUNAY REFINEMENT ALGORITHMS FOR ESTIMATING LOCAL FEATURE SIZE IN 2D AND 3D
• Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains
• Lexicographic optimal chains and critical bases
• An upper bound for conforming Delaunay triangulations
• Meshing volumes bounded by smooth surfaces
• 3D Delaunay refinement of sharp domains without a local feature size oracle
• Collars and intestines: practical conforming Delaunay refinement

This page was built for publication: Conforming Delaunay triangulations in 3D

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