On topological changes in the Delaunay triangulation of moving points

DOI10.1007/s00454-013-9512-2zbMath1275.52021arXiv1304.3671MaRDI 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 diagram; combinatorial complexity; Delaunay triangulation; discrete changes; kinetic algorithms; moving points

Mathematics Subject Classification ID

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

52C45: Combinatorial complexity of geometric structures