Lower bounds for expected-case planar point location
From MaRDI portal
Publication:2462734
DOI10.1016/j.comgeo.2007.06.001zbMath1128.65021OpenAlexW2084300808MaRDI QIDQ2462734
Publication date: 3 December 2007
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2007.06.001
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Expected asymptotically optimal planar point location
- A simple entropy-based algorithm for planar point location
- A Best Possible Bound for The Weighted Path Length of Binary Search Trees
- On the Exact Worst Case Query Complexity of Planar Point Location
- Optimal Expected-Case Planar Point Location