2 search results - page 1 / 1 » Lower Bounds on the Complexity of Simplex Range Reporting on... |
ICALP
1992
Springer
13 years 8 months ago
1992
Springer
Abstract Bernard Chazelle Department of Computer Science Princeton University Burton Rosenberg Department of Mathematics and Computer Science Dartmouth College We give a lower bou...
COMPGEOM
2010
ACM
13 years 9 months ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...