On topological changes in the Delaunay triangulation of moving points

DOI10.1007/s00454-013-9512-2zbMath1275.52021arXiv1304.3671OpenAlexW2092074133MaRDI QIDQ2391707

Natan Rubin

Publication date: 5 August 2013

Published in: Discrete \& Computational Geometry, Proceedings of the twenty-eighth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.3671

zbMATH Keywords

Voronoi diagramcombinatorial complexityDelaunay triangulationdiscrete changeskinetic algorithmsmoving points

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial complexity of geometric structures (52C45)

Related Items (4)

Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions ⋮ Stable Delaunay graphs ⋮ On Kinetic Delaunay Triangulations ⋮ A simple, faster method for kinetic proximity problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A kinetic triangulation scheme for moving points in the plane
• Near-quadratic bounds for the \(L_ 1\) Voronoi diagram of moving points
• A two-dimensional kinetic triangulation with near-quadratic topological changes
• Ready, set, go! The Voronoi diagram of moving points that start from a line
• New bounds for lower envelopes in three dimensions, with applications to visibility in terrains
• Applications of random sampling in computational geometry. II
• The overlay of lower envelopes and its applications
• Geometry and Topology for Mesh Generation
• On Kinetic Delaunay Triangulations
• VORONOI DIAGRAMS OF MOVING POINTS IN THE PLANE
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• 3-Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations
• Kinetic stable Delaunay graphs

This page was built for publication: On topological changes in the Delaunay triangulation of moving points