Data structures for range-aggregate extent queries

Prosenjit Gupta, Ravi Janardan, Yokesh Kumar, Michiel Smid

Research output: Contribution to conferencePaperpeer-review

8 Scopus citations

Abstract

We consider a generalization of geometric range searching, with the goal of generating an informative "summary" of the objects contained in a query range via the application of a suitable aggregation function on these objects. We provide some of the first results for functions such as closest pair, diameter, and width that measure the extent (or "spread") of the retrieved set. We discuss a subset of our results, including closest pair queries on point-sets in the plane and on random pointsets in ℝd (d ≥ 2) and guaranteed-quality approximations for diameter and width queries in the plane, all for axes-parallel query rectangles.

Original languageEnglish (US)
Pages7-10
Number of pages4
StatePublished - 2008
Event20th Annual Canadian Conference on Computational Geometry, CCCG 2008 - Montreal, QC, Canada
Duration: Aug 13 2008Aug 15 2008

Other

Other20th Annual Canadian Conference on Computational Geometry, CCCG 2008
CountryCanada
CityMontreal, QC
Period8/13/088/15/08

Fingerprint Dive into the research topics of 'Data structures for range-aggregate extent queries'. Together they form a unique fingerprint.

Cite this