Data Structures for Range Aggregation by Categories


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 ≥ 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… (More)