Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:author |
C. Barber
D. Dobkin H. Huhdanpaa |
| gptkbp:averageCaseComplexity |
O(n log n)
|
| gptkbp:canBe |
3D
2D |
| gptkbp:field |
gptkb:geometry
|
| gptkbp:firstPublished |
1996
|
| https://www.w3.org/2000/01/rdf-schema#label |
Quickhull
|
| gptkbp:input |
set of points
|
| gptkbp:inspiredBy |
gptkb:Quicksort
|
| gptkbp:isDivideAndConquer |
true
|
| gptkbp:openSource |
Qhull
|
| gptkbp:output |
convex hull
|
| gptkbp:supportsAlgorithm |
gptkb:Graham_scan
Gift wrapping algorithm Incremental algorithm |
| gptkbp:usedFor |
convex hull computation
|
| gptkbp:worstCaseComplexity |
O(n^2)
|
| gptkbp:bfsParent |
gptkb:convex_envelope
|
| gptkbp:bfsLayer |
7
|