Concepedia

Segment Intersection Complexity Analysis

Segment Intersection Complexity Analysis is a theoretical framework within computational geometry that characterizes the asymptotic behavior of algorithms designed to detect or report intersections among line segments in the plane, specifically by analyzing the relationship between input size and the number of potential pairwise intersections.

19

Publications

1K

Citations

22

Authors

22

Institutions

Publications per year

2017–2026

1

Parents

Publications

19

An optimal algorithm for intersecting line segments in the plane

Bernard Chazelle, Herbert Edelsbrunner · Journal of the ACM · 1992 · 327 citations · Full text

, , +12

On Symmetry Detection

Atallah · IEEE Transactions on Computers · 1985 · 189 citations

, , +13

An optimal algorithm for intersecting line segments in the plane

Bernard Chazelle, Herbert Edelsbrunner · 1988 · 85 citations

, , +12

Rectilinear line segment intersection, layered segment trees, and dynamization

Vijay K. Vaishnavi, D. Wood · Journal of Algorithms · 1982 · 71 citations

, , +13

Double precision geometry: a general technique for calculating line and segment intersections using rounded arithmetic

Victor Milenkovic · 1989 · 56 citations

, , +16

1–5 of 19

Authors

22

  1. TM
    Timothy M. Chan

    University of Waterloo, Canada

    2 publications · 35 citations

    2

    h-index

  2. BC
    Bernard Chazelle

    Princeton University, United States

    2 publications · 412 citations

    2

    h-index

  3. JS
    Jack Snoeyink

    University of North Carolina at Chapel Hill, United States

    2 publications · 48 citations

    2

    h-index

  4. JB
    Jean‐Daniel Boissonnat

    Institut national de recherche en sciences et technologies du numérique, France

    2 publications · 48 citations

    2

    h-index

  5. HE
    Herbert Edelsbrunner

    University of Illinois Urbana-Champaign, United States

    2 publications · 412 citations

    2

    h-index

1–5 of 22

Institutions

22

  1. University of Waterloo

    Waterloo, Canada

    3 h-index

    5 publications

    141 citations

  2. Institut national de recherche en sciences et technologies du numérique

    Le Chesnay-Rocquencourt, France

    2 h-index

    2 publications

    48 citations

  3. University of Illinois Urbana-Champaign

    Urbana, United States

    2 h-index

    2 publications

    130 citations

  4. Princeton University

    Princeton, United States

    2 h-index

    2 publications

    412 citations

  5. University of Illinois System

    Urbana, United States

    2 h-index

    2 publications

    412 citations

  6. University of North Carolina at Chapel Hill

    Chapel Hill, United States

    2 h-index

    2 publications

    48 citations

  7. Harvard University Press

    Cambridge, United States

    1 h-index

    1 publications

    56 citations

  8. Purdue University West Lafayette

    West Lafayette, United States

    1 h-index

    1 publications

    189 citations

1–8 of 22

Venues

  1. Computational Geometry

    2 publications · 51 citations

    2

    h-index

  2. Networks

    1 publications · 45 citations

    1

    h-index

  3. SIAM Journal on Computing

    1 publications · 11 citations

    1

    h-index

  4. IEEE Transactions on Computers

    1 publications · 189 citations

    1

    h-index

  5. Journal of Algorithms

    1 publications · 71 citations

    1

    h-index

1–5