Intersection Counting

Intersection Counting is a computational method within the field of geometric algorithms that identifies and quantifies the number of pairwise intersections among a set of geometric objects in a given space.

170

Publications

8.3K

Citations

277

Authors

160

Institutions

Publications per year

2017–2026

14

Authors

277

  1. MS
    Micha Sharir

    Tel Aviv University, Israel

    7 publications · 380 citations

    7

    h-index

  2. HE
    Herbert Edelsbrunner

    University of Illinois Urbana-Champaign, United States

    5 publications · 465 citations

    5

    h-index

  3. EW
    Emo Welzl

    Freie Universität Berlin, Germany

    3 publications · 127 citations

    3

    h-index

  4. FH
    F. H. White

    University of Sheffield, United Kingdom

    3 publications · 50 citations

    3

    h-index

  5. JZ
    Joshua Zahl

    Massachusetts Institute of Technology, United States

    3 publications · 95 citations

    3

    h-index

1–5 of 277

Venues

  1. Information Processing Letters

    8 publications · 142 citations

    8

    h-index

  2. Discrete & Computational Geometry

    8 publications · 317 citations

    8

    h-index

  3. arXiv (Cornell University)

    Repository · 6 publications · 132 citations

    6

    h-index

  4. Computational Geometry

    5 publications · 114 citations

    5

    h-index

  5. Discrete Mathematics

    5 publications · 99 citations

    5

    h-index

1–5