A Robust Implementation for Three-Dimensional Delaunay Triangulations
From MaRDI portal
Publication:4513210
DOI10.1142/S0218195998000138zbMath1035.68539MaRDI QIDQ4513210
Publication date: 7 November 2000
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (5)
FARAWAY POINT: A SENTINEL POINT FOR DELAUNAY COMPUTATION ⋮ There are simple and robust refinements (almost) as good as Delaunay ⋮ Preferred directions for resolving the non-uniqueness of Delaunay triangulations ⋮ Kinetic and dynamic Delaunay tetrahedralizations in three dimensions ⋮ WHEN AND WHY DELAUNAY REFINEMENT ALGORITHMS WORK
Cites Work
- The legacy of automatic mesh generation from solid modeling
- Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions
- Higher-dimensional Voronoi diagrams in linear expected time
- A geometric consistency theorem for a symbolic perturbation scheme
- Primitives for the manipulation of three-dimensional subdivisions
- Incremental topological flipping works for regular triangulations
- Fast Delaunay triangulation in three dimensions
- Symbolic treatment of geometric degeneracies
- 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
- Delaunay's mesh of a convex polyhedron in dimension d. application to arbitrary polyhedra
- An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems
- Computing Dirichlet Tessellations in the Plane
- Three-dimensional alpha shapes
- Three-Dimensional Triangulations from Local Transformations
This page was built for publication: A Robust Implementation for Three-Dimensional Delaunay Triangulations
