Results 1 
1 of
1
Data Structures for Range Aggregation by Categories 21st
 Canadian Conference on Computational Geometry (CCCG2009
, 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) in R d, d ≥ 1 such that given a query orthogonal range q, we can report efficiently for each distinct color c of the po ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
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) in R d, d ≥ 1 such that given a query orthogonal range q, we can report efficiently for each distinct color c of the points in S ∩q, the tuple < c, F(c)> where F(c) is a function (e.g. weighted sum, bounding box etc.) of the objects of color c in q. 1