Kinetic stable Delaunay graphs
From MaRDI portal
Publication:5405875
DOI10.1145/1810959.1810984zbMath1284.68576arXiv1504.06851OpenAlexW2111128036MaRDI QIDQ5405875
No author found.
Publication date: 3 April 2014
Published in: Proceedings of the twenty-sixth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.06851
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (9)
On topological changes in the Delaunay triangulation of moving points ⋮ Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties ⋮ A kinetic triangulation scheme for moving points in the plane ⋮ Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions ⋮ Stable Delaunay graphs ⋮ Euclidean minimum spanning trees with independent and dependent geometric uncertainties ⋮ On shape Delaunay tessellations ⋮ On Kinetic Delaunay Triangulations ⋮ A simple, faster method for kinetic proximity problems
This page was built for publication: Kinetic stable Delaunay graphs
