Why is the 3D Delaunay triangulation difficult to construct?

DOI10.1016/0020-0190(95)00028-BMaRDI QIDQ673008zbMATH OpenOpenAlexFDO

Authors Hiroshi Inagaki, K. 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)

Cites work

• A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
• An acyclicity theorem for cell complexes in d dimensions
• Axioms and hulls
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 53811 (Why is no real title available?)
• scientific article; zbMATH DE number 62659 (Why is no real title available?)
• scientific article; zbMATH DE number 1079755 (Why is no real title available?)
• IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS
• Two algorithms for constructing a Delaunay triangulation
• Verifiable implementations of geometric algorithms using finite precision arithmetic

Cited in

(1)

• 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)

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

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