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

Authors

94

  1. LA
    Lars Arge

    Aarhus University, Denmark

    7 publications · 321 citations

    7

    h-index

  2. TM
    Timothy M. Chan

    University of Waterloo, Canada

    5 publications · 144 citations

    5

    h-index

  3. YN
    Yakov Nekrich

    University of Kansas, United States

    5 publications · 127 citations

    5

    h-index

  4. KG
    Kasper Green Larsen

    Aarhus University, Denmark

    5 publications · 159 citations

    5

    h-index

  5. BC
    Bernard Chazelle

    Princeton University, United States

    4 publications · 375 citations

    4

    h-index

1–5 of 94

Venues

  1. Computational Geometry

    4 publications · 118 citations

    4

    h-index

  2. SIAM Journal on Computing

    4 publications · 302 citations

    4

    h-index

  3. Journal of the ACM

    JACM · 3 publications · 367 citations

    3

    h-index

  4. Journal of the American Mathematical Society

    JAMS · 2 publications · 122 citations

    2

    h-index

  5. arXiv (Cornell University)

    Repository · 2 publications · 27 citations

    2

    h-index

1–5