Pages that link to "Item:Q3990653"
From MaRDI portal
The following pages link to Efficient Point Location in a Convex Spatial Cell-Complex (Q3990653):
Displaying 12 items.
- Distance-sensitive planar point location (Q283883) (← links)
- Dynamic reachability in planar digraphs with one source and one sink (Q688163) (← links)
- Linear data structures for fast ray-shooting amidst convex polyhedra (Q834599) (← links)
- Complexity of projected images of convex subdivisions (Q1841991) (← links)
- Vertical decompositions for triangles in 3-space (Q1907609) (← links)
- Faster algorithms for growing prioritized disks and rectangles (Q2330036) (← links)
- On point location and motion planning among simplices (Q2817600) (← links)
- Dynamic Trees and Dynamic Point Location (Q4210167) (← links)
- Towards an Optimal Method for Dynamic Planar Point Location (Q4562277) (← links)
- Dynamic Planar Point Location in External Memory. (Q5088984) (← links)
- Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC (Q5221383) (← links)
- I/O-Efficient Point Location in a Set of Rectangles (Q5458571) (← links)