10 search results - page 1 / 2 » On approximate halfspace range counting and relative epsilon... |
COMPGEOM
2007
ACM
15 years 3 months ago
2007
ACM
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
COMPGEOM
2009
ACM
15 years 6 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 ...
SIAMCOMP
2010
14 years 10 months ago
2010
101
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
140
click to vote
WADS
2007
Springer
15 years 5 months ago
2007
Springer
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...