A kinetic triangulation scheme for moving points in the plane
From MaRDI portal
Publication:632719
DOI10.1016/J.COMGEO.2010.11.001zbMATH Open1209.65026OpenAlexW2570182798MaRDI QIDQ632719FDOQ632719
Authors: 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
Recommendations
- A kinetic triangulation scheme for moving points in the plane
- A 2D kinetic triangulation with near-quadratic topological changes
- A two-dimensional kinetic triangulation with near-quadratic topological changes
- On kinetic Delaunay triangulations: a near-quadratic bound for unit speed motions
- Algorithms and Data Structures
Cites Work
- Applications of random sampling in computational geometry. II
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maintenance of configurations in the plane
- Title not available (Why is that?)
- Title not available (Why is that?)
- Data Structures for Mobile Data
- Randomized search trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ray shooting in polygons using geodesic triangulations
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- Kinetic collision detection between two simple polygons.
- Kinetic and dynamic data structures for convex hulls and upper envelopes
- KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
- VORONOI DIAGRAMS OF MOVING POINTS IN THE PLANE
- Kinetic and dynamic data structures for closest pair and all nearest neighbors
- Kinetic stable Delaunay graphs
- A two-dimensional kinetic triangulation with near-quadratic topological changes
Cited In (14)
- On topological changes in the Delaunay triangulation of moving points
- Weak \(\frac 1r\)-nets for moving points
- Kinetic convex hulls, Delaunay triangulations and connectivity structures in the black-box model
- Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions
- A kinetic triangulation scheme for moving points in the plane
- Tracking a moving point in the plane
- Lower bounds for kinetic planar subdivisions
- Kinetic mesh refinement in 2D
- On kinetic Delaunay triangulations: a near-quadratic bound for unit speed motions
- A two-dimensional kinetic triangulation with near-quadratic topological changes
- A novel video compression scheme based on kinetic Delaunay triangulation
- Stable Delaunay graphs
- A 2D kinetic triangulation with near-quadratic topological changes
- Kinetic connectivity for unit disks
This page was built for publication: A kinetic triangulation scheme for moving points in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632719)
