921 search results - page 1 / 185 » New Data Structures for Orthogonal Range Searching |
FOCS
2000
IEEE
13 years 10 months ago
2000
IEEE
CCCG
2010
13 years 7 months ago
2010
We present a data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane. The algorithm requires O(log n + k) time in the worst case t...
COMPGEOM
2003
ACM
13 years 11 months ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
WADS
2009
Springer
14 years 10 days ago
2009
Springer
We present a succinct representation of a set of n points on an n × n grid using n lg n + o(n lg n) bits3 to support orthogonal range counting in O(lg n/ lg lg n) time, and range ...
CCCG
2008
13 years 7 months 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...