On the Exact Worst Case Query Complexity of Planar Point Location

DOI10.1006/JAGM.2000.1101MaRDI QIDQ4512577zbMATH OpenOpenAlexFDO

Authors Raimund Seidel, Udo Adamy

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)

Recommendations

• scientific article; zbMATH DE number 1303604
• scientific article; zbMATH DE number 1617272
• Adaptive point location in planar convex subdivisions
• Adaptive Point Location in Planar Convex Subdivisions
• Towards an optimal method for dynamic planar point location

Cited in

(8)

• On constant factors in comparison-based geometric algorithms and data structures
• Lower bounds for expected-case planar point location
• scientific article; zbMATH DE number 1617272 (Why is no real title available?)
• Succinct and Implicit Data Structures for Computational Geometry
• Optimal randomized incremental construction for guaranteed logarithmic planar point location
• scientific article; zbMATH DE number 1303604 (Why is no real title available?)
• Adaptive planar point location
• Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection

This page was built for publication: On the Exact Worst Case Query Complexity of Planar Point Location

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4512577)