CCCG
2008
14 years 29 days ago
2008
We study a new variant of colored orthogonal range searching problem: given a query rectangle Q all colors c, such that at least a fraction of all points in Q are of color c, mus...
COMPGEOM
1995
ACM
14 years 3 months ago
1995
ACM
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...