Orthogonal Range Queries
Orthogonal Range Queries is a type of range searching problem in computational geometry where the query region is defined by axis-aligned hyperrectangles, distinguishing it from other range queries by its constraint to orthogonal (coordinate-aligned) boundaries.
64
Publications
2.7K
Citations
94
Authors
46
Institutions
Publications per year
2017–2026
3
Variants
Orthogonal Range Query
Parents
64
A data structure for orthogonal range queries
George S. Lueker · 1978 · 209 citations
New Data Structures for Orthogonal Range Queries
Dan E. Willard · SIAM Journal on Computing · 1985 · 165 citations
New data structures for orthogonal range searching
Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe · 2002 · 162 citations
Lower bounds for orthogonal range searching: I. The reporting case
Bernard Chazelle · Journal of the ACM · 1990 · 152 citations · Full text
1–5 of 64
94
7
h-index
5
h-index
5
h-index
5
h-index
4
h-index
1–5 of 94
46

Aarhus University
Aarhus, Denmark
10 h-index
18 publications
685 citations
University at Albany, State University of New York
Albany, United States
4 h-index
5 publications
222 citations
University of California San Diego
San Diego, United States
4 h-index
5 publications
214 citations

University of Waterloo
Waterloo, Canada
4 h-index
5 publications
109 citations
Princeton University
Princeton, United States
3 h-index
4 publications
293 citations
Duke University
Durham, United States
3 h-index
13 publications
506 citations

IT University of Copenhagen
Copenhagen, Denmark
3 h-index
4 publications
387 citations
University of Bonn
Bonn, Germany
3 h-index
4 publications
111 citations
1–8 of 46
4 publications · 118 citations
4
h-index
4 publications · 302 citations
4
h-index
JACM · 3 publications · 367 citations
3
h-index
JAMS · 2 publications · 122 citations
2
h-index
Repository · 2 publications · 27 citations
2
h-index
1–5