Preparata–Hong convex hull algorithm
GPTKB entity
Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:alsoKnownAs |
divide and conquer convex hull algorithm
|
| gptkbp:author |
gptkb:Franco_P._Preparata
Shang-Hua Hong |
| gptkbp:complexity |
O(n log n)
|
| gptkbp:field |
gptkb:geometry
|
| gptkbp:input |
set of points in the plane
|
| gptkbp:introducedIn |
1977
|
| gptkbp:method |
divide and conquer
|
| gptkbp:output |
convex hull of input points
|
| gptkbp:publishedIn |
gptkb:Journal_of_the_ACM
|
| gptkbp:relatedTo |
gptkb:Graham_scan
Andrew's monotone chain algorithm |
| gptkbp:solvedBy |
gptkb:convex_hull_problem
|
| gptkbp:bfsParent |
gptkb:F._Preparata
|
| gptkbp:bfsLayer |
8
|
| https://www.w3.org/2000/01/rdf-schema#label |
Preparata–Hong convex hull algorithm
|