Halfspace Range Searching
Halfspace Range Searching is a range searching paradigm in computational geometry where the query region is defined by a halfspace, distinguishing it from other range searching methods by its use of linear inequalities to partition the space and retrieve points lying on one side of a hyperplane.
24
Publications
974
Citations
29
Authors
25
Institutions
Publications per year
2017–2026
0
Parents
24
Epsilon-nets and simplex range queries
David Haussler, Emo Welzl · 1986 · 142 citations · Full text
Optimal halfspace range reporting in three dimensions
Peyman Afshani, Timothy M. Chan · 2009 · 68 citations
1–5 of 24
29
6
h-index
4
h-index
2
h-index
2
h-index
2
h-index
1–5 of 29
25

University of Waterloo
Waterloo, Canada
4 h-index
6 publications
224 citations
Princeton University
Princeton, United States
3 h-index
4 publications
150 citations

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
3 h-index
5 publications
60 citations
Max Planck Society
Munich, Germany
2 h-index
3 publications
58 citations
University of Maryland, College Park
College Park, United States
2 h-index
2 publications
25 citations
Graz University of Technology
Graz, Austria
2 h-index
3 publications
330 citations

Aarhus University
Aarhus, Denmark
2 h-index
2 publications
39 citations
University of Illinois System
Urbana, United States
1 h-index
1 publications
43 citations
1–8 of 25
6 publications · 222 citations
6
h-index
4 publications · 144 citations
4
h-index
1 publications · 94 citations
1
h-index
1 publications · 22 citations
1
h-index
Conference · 1 publications · 12 citations
1
h-index
1–5