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
Parents
7
1–5 of 7
11
Institut national de recherche en sciences et technologies du numérique, France
1 publications · 59 citations
1
h-index
Institut national de recherche en sciences et technologies du numérique, France
1 publications · 13 citations
1
h-index
1
h-index
University of Illinois Urbana-Champaign, United States
1 publications · 59 citations
1
h-index
1
h-index
1–5 of 11
6
Computer Algorithms for Medicine
Graz, Austria
1 h-index
1 publications
59 citations
University at Buffalo, State University of New York
Buffalo, United States
1 h-index
1 publications
10 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
1 h-index
2 publications
26 citations
Carnegie Mellon University
Pittsburgh, United States
1 h-index
1 publications
50 citations
Max Planck Society
Munich, Germany
1 h-index
2 publications
92 citations

Buffalo State University
Buffalo, United States
1 h-index
1 publications
10 citations
1–6 of 6
3 publications · 104 citations
3
h-index
1 publications · 10 citations
1
h-index
1 publications · 50 citations
1
h-index
1–3