2880 search results - page 19 / 576 » Approximate Range Searching |
CCCG
2008
13 years 8 months ago
2008
We present data structures for triangular emptiness and reporting queries for a planar point set, where the query triangle contains the origin. The data structures use near-linear...
CCCG
2004
13 years 8 months ago
2004
CCCG
2004
13 years 8 months ago
2004
ALENEX
2001
13 years 8 months ago
2001
Range searches in metric spaces can be very di cult if the space is \high dimensional", i.e. when the histogram of distances has a large mean and a small variance. The so-cal...
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...