Pages that link to "Item:Q4512577"
From MaRDI portal
The following pages link to On the Exact Worst Case Query Complexity of Planar Point Location (Q4512577):
Displaying 6 items.
- Optimal randomized incremental construction for guaranteed logarithmic planar point location (Q340542) (← links)
- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection (Q991174) (← links)
- On constant factors in comparison-based geometric algorithms and data structures (Q2349854) (← links)
- Lower bounds for expected-case planar point location (Q2462734) (← links)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
- Adaptive Planar Point Location (Q5009786) (← links)
