Approximate Range Searching
Approximate Range Searching is a computational geometry method that generalizes exact range searching by allowing approximate answers to queries, thereby relaxing the precision requirement to achieve improved efficiency in high-dimensional or large-scale datasets.
46
Publications
1.8K
Citations
103
Authors
52
Institutions
Publications per year
2017–2026
3
Parents
46
Epsilon-nets and simplex range queries
David Haussler, Emo Welzl · 1986 · 142 citations · Full text
On Approximating the Depth and Related Problems
Boris Aronov, Sariel Har-Peled · SIAM Journal on Computing · 2008 · 123 citations
Pankaj K. Agarwal, Siu-Wing Cheng, Yufei Tao et al. · 2009 · 96 citations
1–5 of 46
103
4
h-index
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 103
52
University of Maryland, College Park
College Park, United States
4 h-index
6 publications
267 citations
New York University
New York, United States
3 h-index
3 publications
185 citations
University of California, Santa Barbara
Santa Barbara, United States
3 h-index
4 publications
273 citations
University of California, Irvine
Irvine, United States
3 h-index
7 publications
382 citations

University of Waterloo
Waterloo, Canada
2 h-index
4 publications
114 citations

Aarhus University
Aarhus, Denmark
2 h-index
2 publications
87 citations

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
2 h-index
3 publications
323 citations

University of Calabria
Rende, Italy
2 h-index
3 publications
113 citations
1–8 of 52
5 publications · 211 citations
5
h-index
3 publications · 73 citations
3
h-index
MCOM · 2 publications · 33 citations
2
h-index
2 publications · 142 citations
2
h-index
IJCGA · 1 publications · 24 citations
1
h-index
1–5