7 search results - page 1 / 2 » Cache-oblivious planar orthogonal range searching and counti... |
COMPGEOM
2005
ACM
14 years 11 months ago
2005
ACM
WADS
2009
Springer
15 years 4 months 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 ...
185
click to vote
STOC
2012
ACM
12 years 12 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...
COMPGEOM
1995
ACM
15 years 1 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...