A kinetic triangulation scheme for moving points in the plane
From MaRDI portal
Publication:632719
DOI10.1016/j.comgeo.2010.11.001zbMath1209.65026OpenAlexW2570182798MaRDI QIDQ632719
Haim Kaplan, Natan Rubin, Micha Sharir
Publication date: 25 March 2011
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2010.11.001
Related Items (3)
On topological changes in the Delaunay triangulation of moving points ⋮ Stable Delaunay graphs ⋮ On Kinetic Delaunay Triangulations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A two-dimensional kinetic triangulation with near-quadratic topological changes
- Kinetic and dynamic data structures for convex hulls and upper envelopes
- Maintenance of configurations in the plane
- Ray shooting in polygons using geodesic triangulations
- Kinetic collision detection between two simple polygons.
- Applications of random sampling in computational geometry. II
- Randomized search trees
- VORONOI DIAGRAMS OF MOVING POINTS IN THE PLANE
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- Data Structures for Mobile Data
- KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
- Kinetic and dynamic data structures for closest pair and all nearest neighbors
- Kinetic stable Delaunay graphs
This page was built for publication: A kinetic triangulation scheme for moving points in the plane
