65 search results - page 1 / 13 » Range aggregate structures for colored geometric objects |
CCCG
2010
14 years 10 days 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...
CCCG
2009
13 years 12 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...
CCCG
2008
14 years 10 days ago
2008
We consider a generalization of geometric range searching, with the goal of generating an informative "summary" of the objects contained in a query range via the applica...
ECCV
2004
Springer
15 years 23 days ago
2004
Springer
Abstract. For structured-light range imaging, color stripes can be used for increasing the number of distinguishable light patterns compared to binary BW stripes. Therefore, an app...
CCCG
2006
14 years 8 days ago
2006
In a range-aggegate query problem we wish to preprocess a set S of geometric objects such that given a query orthogonal range q, a certain intersection or proximity query on the o...