Statements (29)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
computational geometry problem
|
| gptkbp:application |
gptkb:GIS
robotics image processing pattern recognition collision detection computational geometry algorithms |
| gptkbp:complexity |
O(n log n) for best known algorithms
|
| gptkbp:describes |
The convex hull problem is the problem of finding the smallest convex polygon that contains a set of points in the plane.
|
| gptkbp:dimensions |
3D
2D |
| gptkbp:field |
gptkb:geometry
gptkb:mathematics computer science |
| gptkbp:firstPublished |
1956
|
| gptkbp:generalizes |
higher dimensions
|
| https://www.w3.org/2000/01/rdf-schema#label |
convex hull problem
|
| gptkbp:input |
finite set of points
|
| gptkbp:notableContributor |
gptkb:Franco_P._Preparata
gptkb:Ronald_Graham gptkb:Michael_Ian_Shamos |
| gptkbp:output |
convex hull of the points
|
| gptkbp:relatedTo |
convex hull
|
| gptkbp:supportsAlgorithm |
gptkb:Graham_scan
gptkb:Jarvis_march gptkb:Quickhull Divide and conquer |
| gptkbp:bfsParent |
gptkb:Kirkpatrick–Seidel_algorithm
|
| gptkbp:bfsLayer |
7
|