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

Authors

26

  1. BC
    Bernard Chazelle

    Princeton University, United States

    3 publications · 131 citations

    3

    h-index

  2. PK
    Pankaj K. Agarwal

    Duke University, United States

    2 publications · 155 citations

    2

    h-index

  3. TM
    Timothy M. Chan

    University of Waterloo, Canada

    2 publications · 92 citations

    2

    h-index

  4. PG
    Prosenjit Gupta

    University of Minnesota, United States

    2 publications · 36 citations

    2

    h-index

  5. DM
    David M. Mount

    University of Maryland, College Park, United States

    2 publications · 25 citations

    2

    h-index

1–5 of 26

Venues

  1. Discrete & Computational Geometry

    3 publications · 114 citations

    3

    h-index

  2. SIAM Journal on Computing

    3 publications · 86 citations

    3

    h-index

  3. Algorithmica

    1 publications · 123 citations

    1

    h-index

  4. Computational Geometry

    1 publications · 22 citations

    1

    h-index

  5. 1

    h-index

1–5