Recommendations
- Vertex deletion for 3D Delaunay triangulations
- Vertex removal in two-dimensional Delaunay triangulation: speed-up by low degrees optimization
- Fully dynamic Delaunay triangulation in logarithmic expected per operation
- scientific article; zbMATH DE number 2079354
- Regular triangulations of dynamic sets of points
Cites work
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- A probabilistic analysis of the power of arithmetic filters
- Computing Dirichlet Tessellations in the Plane
- Further results on arithmetic filters for geometric predicates
- Incremental topological flipping works for regular triangulations
- Intersections with random geometric objects
- Interval arithmetic yields efficient dynamic filters for computational geometry
- Power Diagrams: Properties, Algorithms and Applications
- Removing degeneracies by perturbing the problem or perturbing the world
- Shellable Decompositions of Cells and Spheres.
- THE DELAUNAY HIERARCHY
- The nature and meaning of perturbations in geometric computing
Cited in
(7)- Dilation-Optimal Edge Deletion in Polygonal Cycles
- Fully dynamic Delaunay triangulation in logarithmic expected per operation
- scientific article; zbMATH DE number 2079354 (Why is no real title available?)
- An interface-preserving moving mesh in multiple space dimensions
- Vertex removal in two-dimensional Delaunay triangulation: speed-up by low degrees optimization
- Kinetic and dynamic Delaunay tetrahedralizations in three dimensions
- Vertex deletion for 3D Delaunay triangulations
This page was built for publication: ON DELETION IN DELAUNAY TRIANGULATIONS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4818555)
