Range aggregate structures for colored geometric objects

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 in S q, the tuple c, F(c) is reported where F(c) is the object of color c with the maximum weight.

• Type: Conference
• Year: 2010
• Where: CCCG
• Authors: Saladi Rahul, Haritha Bellam, Prosenjit Gupta, Krishnan Rajan
• Keywords: CCCG 2010, Computational Geometry, Distinct Color, Orthogonal Range Q