Tight lower bounds for halfspace range searching

DOI10.1145/1810959.1810964zbMath1284.68579OpenAlexW2061544335MaRDI QIDQ5405859

Jian Xia, David M. Mount, Sunil Arya

Publication date: 3 April 2014

Published in: Proceedings of the twenty-sixth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.308.5994

zbMATH Keywords

lower boundsrange searchingidempotence

Mathematics Subject Classification ID

Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Optimal partition trees

This page was built for publication: Tight lower bounds for halfspace range searching