Delaunay triangulations in three dimensions with finite precision arithmetic

DOI10.1016/0167-8396(92)90044-PzbMath0762.65110OpenAlexW2064008635MaRDI QIDQ1195754

Chandrajit L. Bajaj, Kōkichi Sugihara, Tamal Krishna Dey

Publication date: 18 January 1993

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8396(92)90044-p

zbMATH Keywords

algorithmrobustnessDelaunay triangulationfinite precision arithmetic

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Triangulation and topological properties of semi-analytic andsubanalytic sets, and related questions (32B25)

Related Items (3)

Updating the topology of the dynamic Voronoi diagram for spheres in Euclidean \(d\)-dimensional space ⋮ Classroom examples of robustness problems in geometric computations ⋮ Robust Point-Location in Generalized Voronoi Diagrams

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Verifiable implementations of geometric algorithms using finite precision arithmetic
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• ON GOOD TRIANGULATIONS IN THREE DIMENSIONS

This page was built for publication: Delaunay triangulations in three dimensions with finite precision arithmetic