Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:allows |
number of line segments
|
| gptkbp:category |
geometric algorithm
|
| gptkbp:complexity |
O((n + k) log n)
|
| gptkbp:field |
gptkb:geometry
|
| https://www.w3.org/2000/01/rdf-schema#label |
Bentley–Ottmann algorithm
|
| gptkbp:introduced |
gptkb:Jon_Louis_Bentley
gptkb:Thomas_Ottmann |
| gptkbp:introducedIn |
1979
|
| gptkbp:kraj |
number of intersection points
|
| gptkbp:output |
all intersection points among line segments
|
| gptkbp:publishedIn |
gptkb:Acta_Informatica
|
| gptkbp:solvedBy |
line segment intersection problem
|
| gptkbp:uses |
event queue
balanced binary search tree sweep line technique |
| gptkbp:bfsParent |
gptkb:Jon_Louis_Bentley
gptkb:Jon_Bentley |
| gptkbp:bfsLayer |
6
|