Range aggregate structures for colored geometric objects

13 years 6 months ago

Download www.cs.umanitoba.ca

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.

Saladi Rahul, Haritha Bellam, Prosenjit Gupta, Kri

Real-time Traffic

CCCG 2010 | Computational Geometry | Distinct Color | Orthogonal Range Q |

claim paper

» Data Structures for RangeAggregate Extent Queries

» HighContrast ColorStripe Pattern for Rapid StructuredLight Range Imaging

» RangeAggregate Proximity Detection for Design Rule Checking in VLSI Layouts

» Efficient Surface Reconstruction from Range Curves

» Detection of Artificial Structures in NaturalScene Images Using Dynamic Trees

» Color and Scale The Spatial Structure of Color Images

» Probabilistic Threshold Range Aggregate Query Processing over Uncertain Data

» Scratchpad allocation for data aggregates in superperfect graphs

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2010
Where	CCCG
Authors	Saladi Rahul, Haritha Bellam, Prosenjit Gupta, Krishnan Rajan

Comments (0)

Sciweavers

Range aggregate structures for colored geometric objects

CCCG 2010 | Computational Geometry | Distinct Color | Orthogonal Range Q |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers