The following pages link to (Q2721994):
Displaying 14 items.
- Optimal randomized incremental construction for guaranteed logarithmic planar point location (Q340542) (← links)
- Dynamic planar point location with optimal query time (Q914389) (← links)
- Expected time analysis for Delaunay point location (Q1882851) (← links)
- Expected asymptotically optimal planar point location (Q1883578) (← links)
- Biased range trees (Q2428657) (← links)
- Lower bounds for expected-case planar point location (Q2462734) (← links)
- (Q2728891) (← links)
- A simple entropy-based algorithm for planar point location (Q2768304) (← links)
- A simple entropy-based algorithm for planar point location (Q2944554) (← links)
- Efficient Point Location in a Convex Spatial Cell-Complex (Q3990653) (← links)
- On the Exact Worst Case Query Complexity of Planar Point Location (Q4512577) (← links)
- Adaptive Point Location in Planar Convex Subdivisions (Q5370568) (← links)
- I/O-Efficient Point Location in a Set of Rectangles (Q5458571) (← links)
- On solving unreliable planar location problems (Q5926602) (← links)