Half-space Range Searching
Half-Space Range Searching is a geometric query processing method that, given a set of points in a d-dimensional space, identifies all points lying within a specified half-space, distinguished from other range searching techniques by its use of linear inequalities to define the query region.
17
Publications
704
Citations
26
Authors
23
Institutions
Publications per year
2017–2026
0
Parents
17
Epsilon-nets and simplex range queries
David Haussler, Emo Welzl · 1986 · 142 citations · Full text
Dynamic half-space range reporting and its applications
Pankaj K. Agarwal, J. Matoušek · Algorithmica · 1995 · 123 citations
Optimal halfspace range reporting in three dimensions
Peyman Afshani, Timothy M. Chan · 2009 · 68 citations
Partitioning Space for Range Queries
Fei Yao, David Dobkin, Herbert Edelsbrunner et al. · SIAM Journal on Computing · 1989 · 43 citations
1–5 of 17
26
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 26
23
Princeton University
Princeton, United States
3 h-index
4 publications
150 citations
Charles University
Prague, Czechia
2 h-index
2 publications
155 citations

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
2 h-index
4 publications
50 citations
Duke University
Durham, United States
2 h-index
2 publications
155 citations
University of Maryland, College Park
College Park, United States
2 h-index
2 publications
25 citations

University of Waterloo
Waterloo, Canada
2 h-index
4 publications
184 citations
Max Planck Society
Munich, Germany
2 h-index
3 publications
58 citations

Aarhus University
Aarhus, Denmark
2 h-index
2 publications
39 citations
1–8 of 23
3 publications · 114 citations
3
h-index
3 publications · 86 citations
3
h-index
1 publications · 123 citations
1
h-index
1 publications · 22 citations
1
h-index
Conference · 1 publications · 24 citations
1
h-index
1–5