A kinetic triangulation scheme for moving points in the plane
From MaRDI portal
Publication:5405876
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
- Algorithms and Data Structures
- On kinetic Delaunay triangulations: a near-quadratic bound for unit speed motions
Cited in
(13)- Weak \(\frac 1r\)-nets for moving points
- Kinetic convex hulls, Delaunay triangulations and connectivity structures in the black-box model
- Tracking a moving point in the plane
- Lower bounds for kinetic planar subdivisions
- Kinetic convex hulls and Delaunay triangulations in the black-box model
- A package for exact kinetic data structures and sweepline algorithms
- Kinetic mesh refinement in 2D
- A kinetic triangulation scheme for moving points in the plane
- A two-dimensional kinetic triangulation with near-quadratic topological changes
- On kinetic Delaunay triangulations: a near-quadratic bound for unit speed motions
- A novel video compression scheme based on kinetic Delaunay triangulation
- 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 Q5405876)