ON DELETION IN DELAUNAY TRIANGULATIONS

DOI10.1142/S0218195902000815zbMath1152.68663OpenAlexW2099634506MaRDI QIDQ4818555

Olivier Devillers

Publication date: 29 September 2004

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

Full work available at URL: https://doi.org/10.1142/s0218195902000815

zbMATH Keywords

powercomputational geometryDelaunayspace of circles

Mathematics Subject Classification ID

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

Related Items (2)

Vertex removal in two-dimensional Delaunay triangulation: speed-up by low degrees optimization ⋮ Kinetic and dynamic Delaunay tetrahedralizations in three dimensions

Cites Work

• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• A probabilistic analysis of the power of arithmetic filters
• The nature and meaning of perturbations in geometric computing
• Intersections with random geometric objects
• Further results on arithmetic filters for geometric predicates
• Incremental topological flipping works for regular triangulations
• Removing degeneracies by perturbing the problem or perturbing the world
• THE DELAUNAY HIERARCHY
• Computing Dirichlet Tessellations in the Plane
• Power Diagrams: Properties, Algorithms and Applications
• Shellable Decompositions of Cells and Spheres.
• Interval arithmetic yields efficient dynamic filters for computational geometry

This page was built for publication: ON DELETION IN DELAUNAY TRIANGULATIONS