Intersection Queries

Intersection Queries is an algorithmic framework in computational geometry that enables efficient determination of spatial overlaps between geometric entities by systematically identifying pairs of objects whose boundaries intersect within a given dataset.

231

Publications

14.9K

Citations

452

Authors

202

Institutions

Publications per year

2017–2026

19

Authors

452

  1. DM
    Dinesh Manocha

    University of North Carolina at Chapel Hill, United States

    19 publications · 1.5K citations

    18

    h-index

  2. MC
    Ming C. Lin

    University of North Carolina at Chapel Hill, United States

    10 publications · 1.1K citations

    10

    h-index

  3. RJ
    Ravi Janardan

    University of Minnesota, United States

    8 publications · 283 citations

    9

    h-index

  4. DD
    David Dobkin

    Princeton University, United States

    7 publications · 481 citations

    7

    h-index

  5. GZ
    Gabriel Zachmann

    University of Bonn, Germany

    7 publications · 406 citations

    7

    h-index

1–5 of 452

Venues

  1. Computational Geometry

    10 publications · 305 citations

    10

    h-index

  2. Computer Graphics Forum

    7 publications · 443 citations

    7

    h-index

  3. Journal of Algorithms

    7 publications · 289 citations

    7

    h-index

  4. SIAM Journal on Computing

    6 publications · 377 citations

    6

    h-index

  5. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 4 publications · 218 citations

    5

    h-index

1–5