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 Rd , 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.

• Type: Conference
• Year: 2009
• Where: CCCG
• Authors: Saladi Rahul, Prosenjit Gupta, K. S. Rajan
• Keywords: CCCG 2007, CCCG 2009, Geometric Objects, Query Orthogonal Range, Weighted Sum