19 search results - page 1 / 4 » Orthogonal Range Reporting in Three and Higher Dimensions |
FOCS
2009
IEEE
14 years 1 months ago
2009
IEEE
In orthogonal range reporting we are to preprocess N points in d-dimensional space so that the points inside a d-dimensional axis-aligned query box can be reported efficiently. T...
COMPGEOM
2010
ACM
13 years 11 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. ...
COMPGEOM
2009
ACM
14 years 23 days ago
2009
ACM
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...
CCCG
2003
13 years 7 months ago
2003
We present a novel k-dimensional range search algorithm for reporting all k-d rectangles from a set D of size n intersecting a query rectangle. Our algorithm uses 2kd tries to sol...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In this paper we describe a dynamic external memory data structure that supports range reporting queries in three dimensions in O(log2 B N + k B ) I/O operations, where k is the nu...