Lower bounds on the complexity of simplex range reporting on a pointer machine
- 1 January 1992
- book chapter
- Published by Springer Nature
- p. 439-449
- https://doi.org/10.1007/3-540-55719-9_95
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Efficient partition treesPublished by Association for Computing Machinery (ACM) ,1991
- Lower bounds for orthogonal range searching: I. The reporting caseJournal of the ACM, 1990
- Quasi-optimal upper bounds for simplex range searching and new zone theoremsPublished by Association for Computing Machinery (ACM) ,1990
- Quasi-optimal range searching in spaces of finite VC-dimensionDiscrete & Computational Geometry, 1989
- Lower bounds on the complexity of polytope range searchingJournal of the American Mathematical Society, 1989
- Halfplanar range search in linear space and O(n0.695) query timeInformation Processing Letters, 1986
- Filtering Search: A New Approach to Query-AnsweringSIAM Journal on Computing, 1986
- Polygonal intersection searchingInformation Processing Letters, 1982
- A Lower Bound for Heilbronn'S ProblemJournal of the London Mathematical Society, 1982
- On Heilbronn's Triangle ProblemJournal of the London Mathematical Society, 1981