On approximate range counting and depth (2007)
| Venue: | In Proc. 23rd Annu. ACM Sympos. Comput. Geom |
| Citations: | 18 - 1 self |
BibTeX
@INPROCEEDINGS{Afshani07onapproximate,
author = {Peyman Afshani},
title = {On approximate range counting and depth},
booktitle = {In Proc. 23rd Annu. ACM Sympos. Comput. Geom},
year = {2007},
pages = {337--343}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
ABSTRACT We improve the previous results by Aronov and Har-Peled (SODA'05) and Kaplan and Sharir (SODA'06) and present a randomized data structure of O(n) expected size which can answer 3D approximate halfspace range counting queries in O(log n k) expected time, where k is the actual value of the count. This is the first optimal method for the problem in the standard decision tree model; moreover, unlike previous methods, the new method is Las Vegas instead of Monte Carlo. In addition, we describe new results for several related problems, including approximate Tukey depth queries in 3D, approximate regression depth queries in 2D, and approximate linear programming with violations in low dimensions. Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems--geometrical problems and computations
