The power of nonmonotonicity in geometric searching

DOI10.1007/S00454-003-2946-1MaRDI QIDQ1424314zbMATH OpenOpenAlexFDO

Authors Bernard Chazelle

Publication date 11 March 2004

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00454-003-2946-1

zbMATH Keywords

line range searching

Mathematics Subject Classification ID

Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• The power of nonmonotonicity in geometric searching
• A Spectral Approach to Lower Bounds with Applications to Geometric Searching
• How hard is half-space range searching?
• Lower Bounds on the Complexity of Polytope Range Searching
• On range searching with semialgebraic sets

Cited in

(2)

• The power of nonmonotonicity in geometric searching
• The Geometry of Generalized Binary Search

This page was built for publication: The power of nonmonotonicity in geometric searching

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