Efficient Point Location in a Convex Spatial Cell-Complex
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 140454
- A space-efficient framework for dynamic point location
- scientific article; zbMATH DE number 1617272
- Simple and efficient distribution-sensitive point location in triangulations
- Adaptive point location in planar convex subdivisions
- Adaptive Point Location in Planar Convex Subdivisions
- Robust Point-Location in Generalized Voronoi Diagrams
- A new point-location algorithm and its practical efficiency: comparison with existing algorithms
- Towards an optimal method for dynamic planar point location
- Dynamic planar point location with optimal query time
Cited in
(14)- Complexity of projected images of convex subdivisions
- Vertical decompositions for triangles in 3-space
- Faster algorithms for growing prioritized disks and rectangles
- On point location and motion planning among simplices
- Distance-sensitive planar point location
- scientific article; zbMATH DE number 140454 (Why is no real title available?)
- Dynamic Trees and Dynamic Point Location
- Towards an optimal method for dynamic planar point location
- Dynamic Planar Point Location in External Memory.
- Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC
- I/O-Efficient Point Location in a Set of Rectangles
- Dynamic reachability in planar digraphs with one source and one sink
- Combinatorial characterizations and algorithms for trajectory planning of an articulated robotic probe in three dimensions
- Linear data structures for fast ray-shooting amidst convex polyhedra
This page was built for publication: Efficient Point Location in a Convex Spatial Cell-Complex
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3990653)
