Bentley-ottmann Algorithm

The Bentley-Ottmann Algorithm is a sweep line algorithm in computational geometry that efficiently detects all intersection points among a set of line segments in the plane by systematically processing geometric events in sorted order.

7

Publications

223

Citations

11

Authors

6

Institutions

Publications per year

2017–2026

0

Authors

11

  1. JB
    Jean‐Daniel Boissonnat

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

    1 publications · 59 citations

    1

    h-index

  2. FC
    Frédéric Cazals

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

    1 publications · 13 citations

    1

    h-index

  3. MS
    Micha Sharir

    Tel Aviv University, Israel

    1 publications · 34 citations

    1

    h-index

  4. FP
    Franco P. Preparata

    University of Illinois Urbana-Champaign, United States

    1 publications · 59 citations

    1

    h-index

  5. KQ
    Kevin Q. Brown

    Carnegie Mellon University, United States

    1 publications · 50 citations

    1

    h-index

1–5 of 11

Venues

  1. SIAM Journal on Computing

    3 publications · 104 citations

    3

    h-index

  2. International Journal of Computer Mathematics

    1 publications · 10 citations

    1

    h-index

  3. IEEE Transactions on Computers

    1 publications · 50 citations

    1

    h-index

1–3