Intersection Enumeration

Intersection Enumeration is a computational method in computational geometry that systematically identifies and lists all pairwise intersections among a set of line segments in the plane, distinguishing itself by its focus on complete and exact enumeration rather than detection or counting alone.

27

Publications

2.1K

Citations

45

Authors

29

Institutions

Publications per year

2017–2026

1

Authors

45

  1. HE
    Herbert Edelsbrunner

    University of Illinois Urbana-Champaign, United States

    3 publications · 199 citations

    3

    h-index

  2. BE
    Bentley

    Carnegie Mellon University, United States

    2 publications · 1.2K citations

    2

    h-index

  3. ST
    Shin‐ichi Tanigawa

    Kyoto University, Japan

    2 publications · 27 citations

    2

    h-index

  4. MS
    Micha Sharir

    Tel Aviv University, Israel

    2 publications · 32 citations

    2

    h-index

  5. TK
    Tamal K. Dey

    The Ohio State University, United States

    2 publications · 83 citations

    2

    h-index

1–5 of 45

Venues

  1. IEEE Transactions on Computers

    4 publications · 1.4K citations

    4

    h-index

  2. Discrete & Computational Geometry

    3 publications · 134 citations

    3

    h-index

  3. Journal of High Energy Physics

    JHEP · 1 publications · 19 citations

    1

    h-index

  4. SIAM Journal on Computing

    1 publications · 20 citations

    1

    h-index

  5. Journal of Physics A Mathematical and General

    1 publications · 22 citations

    1

    h-index

1–5