A Robust Implementation for Three-Dimensional Delaunay Triangulations

DOI10.1142/S0218195998000138MaRDI QIDQ4513210zbMATH OpenFDO

Authors E. P. Mücke

Publication date 7 November 2000

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

randomizationrobustnessincremental flip algorithm

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

Recommendations

• Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions
• Construction of K-Dimensional Delaunay Triangulations Using Local Transformations
• Conforming Delaunay triangulations in 3D
• The implementation of an algorithm to find the convex hull of a set of three-dimensional points
• A faster circle-sweep Delaunay triangulation algorithm

Cites work

• A geometric consistency theorem for a symbolic perturbation scheme
• An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems
• Computing Dirichlet Tessellations in the Plane
• Delaunay's mesh of a convex polyhedron in dimension d. application to arbitrary polyhedra
• Fast Delaunay triangulation in three dimensions
• Higher-dimensional Voronoi diagrams in linear expected time
• Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions
• Incremental topological flipping works for regular triangulations
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Primitives for the manipulation of three-dimensional subdivisions
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• Symbolic treatment of geometric degeneracies
• The legacy of automatic mesh generation from solid modeling
• Three-Dimensional Triangulations from Local Transformations
• Three-dimensional alpha shapes

Cited in

(9)

• A functional language to implement the divide-and-conquer Delaunay triangulation algorithm
• There are simple and robust refinements (almost) as good as Delaunay
• Kinetic and dynamic Delaunay tetrahedralizations in three dimensions
• FARAWAY POINT: A SENTINEL POINT FOR DELAUNAY COMPUTATION
• scientific article; zbMATH DE number 5019916 (Why is no real title available?)
• WHEN AND WHY DELAUNAY REFINEMENT ALGORITHMS WORK
• Delaunay triangulations in three dimensions with finite precision arithmetic
• Preferred directions for resolving the non-uniqueness of Delaunay triangulations
• Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions

This page was built for publication: A Robust Implementation for Three-Dimensional Delaunay Triangulations

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