Why is the 3D Delaunay triangulation difficult to construct?

DOI10.1016/0020-0190(95)00028-BzbMath1004.68556OpenAlexW2058714019MaRDI QIDQ673008

Hiroshi Inagaki, Kōkichi Sugihara

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00028-b

zbMATH Keywords

degeneracyDelaunay triangulationnumerical robustnesstopological consistency

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

2D and 3D finite element meshing and remeshing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An acyclicity theorem for cell complexes in d dimensions
• Verifiable implementations of geometric algorithms using finite precision arithmetic
• Axioms and hulls
• IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS
• Two algorithms for constructing a Delaunay triangulation
• A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS

This page was built for publication: Why is the 3D Delaunay triangulation difficult to construct?