Orthogonal Range Reporting
Orthogonal Range Reporting is a computational geometry query problem that, within the broader category of range searching, specifically involves retrieving all points contained in an axis-aligned rectangular range in a multidimensional space.
19
Publications
804
Citations
22
Authors
12
Institutions
Publications per year
2017–2026
1
Parents
19
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
Fully Dynamic Orthogonal Range Reporting on RAM
Christian Worm Mortensen · SIAM Journal on Computing · 2006 · 49 citations
1–5 of 19
22
4
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 22
12

Aarhus University
Aarhus, Denmark
5 h-index
11 publications
495 citations

IT University of Copenhagen
Copenhagen, Denmark
3 h-index
4 publications
387 citations

University of Waterloo
Waterloo, Canada
2 h-index
3 publications
36 citations
University of Bonn
Bonn, Germany
2 h-index
3 publications
55 citations
University of Chile
Santiago, Chile
1 h-index
2 publications
20 citations
Center for Massive Data Algorithmics
Aarhus, Denmark
1 h-index
3 publications
114 citations
University of Kansas
Lawrence, United States
1 h-index
1 publications
22 citations
Carnegie Mellon University
Pittsburgh, United States
1 h-index
1 publications
31 citations
1–8 of 12
JAMS · 2 publications · 122 citations
2
h-index
Repository · 1 publications · 16 citations
1
h-index
Repository · 1 publications · 11 citations
1
h-index
TODS · 1 publications · 22 citations
1
h-index
1 publications · 49 citations
1
h-index
1–5