Range Emptiness Queries
Range Emptiness Queries is a computational query type within range searching that determines whether a specified multidimensional range contains any data points, distinguished by its focus on the absence or presence of elements rather than their retrieval or count.
13
Publications
1.1K
Citations
33
Authors
19
Institutions
Publications per year
2017–2026
2
Parents
13
ɛ-nets and simplex range queries
David Haussler, Emo Welzl · Discrete & Computational Geometry · 1987 · 731 citations · Full text
On Approximating the Depth and Related Problems
Boris Aronov, Sariel Har-Peled · SIAM Journal on Computing · 2008 · 123 citations
On approximating the depth and related problems
Boris Aronov, Sariel Har-Peled · 2005 · 46 citations
Space-Time Tradeoffs for Emptiness Queries
Jeff Erickson · SIAM Journal on Computing · 2000 · 23 citations
1–5 of 13
33
University of Illinois Urbana-Champaign, United States
2 publications · 169 citations
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 33
19
New York University
New York, United States
2 h-index
2 publications
169 citations
University of Illinois Urbana-Champaign
Urbana, United States
2 h-index
2 publications
169 citations
ZTE (China)
Shenzhen, China
1 h-index
1 publications
19 citations
IBM (United States)
Armonk, United States
1 h-index
3 publications
66 citations

University of Electro-Communications
Tokyo, Japan
1 h-index
1 publications
11 citations
Technical University of Denmark
Kongens Lyngby, Denmark
1 h-index
2 publications
24 citations
University of California, Santa Cruz
Santa Cruz, United States
1 h-index
1 publications
731 citations

University of Calabria
Rende, Italy
1 h-index
1 publications
10 citations
1–8 of 19
3 publications · 164 citations
3
h-index
Repository · 1 publications · 13 citations
1
h-index
1 publications · 22 citations
1
h-index
1 publications · 19 citations
1
h-index
1 publications · 11 citations
1
h-index
1–5