Space-Time Tradeoffs for Emptiness Queries
From MaRDI portal
Publication:4507333
DOI10.1137/S0097539798337212zbMath0953.68063MaRDI QIDQ4507333
Publication date: 18 October 2000
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
On counting point-hyperplane incidences ⋮ Tight lower bounds for halfspace range searching ⋮ Simplex Range Searching and Its Variants: A Review ⋮ The effect of corners on the complexity of approximate range searching ⋮ Extremal point queries with lines and line segments and related problems ⋮ IMPROVED POINTER MACHINE AND I/O LOWER BOUNDS FOR SIMPLEX RANGE REPORTING AND RELATED PROBLEMS
This page was built for publication: Space-Time Tradeoffs for Emptiness Queries