182 search results - page 2 / 37 » Approximate Colored Range Queries |
CCCG
2010
13 years 10 months ago
2010
A set of n colored objects (points/hyperboxes) lie in IRd . Each object has a weight associated with it. Given a query orthogonal range q, for each distinct color c of the objects...
COMPGEOM
2009
ACM
14 years 2 months 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
2008
13 years 10 months ago
2008
We study a new variant of colored orthogonal range searching problem: given a query rectangle Q all colors c, such that at least a fraction of all points in Q are of color c, mus...
CCCG
2009
13 years 9 months ago
2009
We solve instances of a general class of problems defined as follows: Preprocess a set S of possibly weighted colored geometric objects (e.g. points/orthogonal segments/rectangles...
SSD
2009
Springer
14 years 2 months ago
2009
Springer
The range nearest-neighbor (NN) query is an important query type in location-based services, as it can be applied to the case that an NN query has a spatial region, instead of a lo...