Bentley - Ottmann Algorithm

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

6

Publications

210

Citations

9

Authors

5

Institutions

Publications per year

2017–2026

0

Authors

9

  1. VE
    Valentin E. Brimkov

    Buffalo State University, United States

    1 publications · 10 citations

    1

    h-index

  2. JB
    Jean‐Daniel Boissonnat

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

    1 publications · 59 citations

    1

    h-index

  3. AE
    Arno Eigenwillig

    Max Planck Institute for Informatics, Germany

    1 publications · 46 citations

    1

    h-index

  4. MK
    Michael Kerber

    Institute of Science and Technology Austria, Austria

    1 publications · 46 citations

    1

    h-index

  5. KQ
    Kevin Q. Brown

    Carnegie Mellon University, United States

    1 publications · 50 citations

    1

    h-index

1–5 of 9

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