On the Exact Worst Case Query Complexity of Planar Point Location

DOI10.1006/jagm.2000.1101zbMath0971.68072OpenAlexW2609482647MaRDI QIDQ4512577

Udo Adamy, Raimund Seidel

Publication date: 30 October 2001

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.2000.1101

zbMATH Keywords

planar point location

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Optimal randomized incremental construction for guaranteed logarithmic planar point location ⋮ Lower bounds for expected-case planar point location ⋮ Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection ⋮ Succinct and Implicit Data Structures for Computational Geometry ⋮ Adaptive Planar Point Location ⋮ On constant factors in comparison-based geometric algorithms and data structures