On the complexity of finding the convex hull of a set of points (Q1158971): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the complexity of finding the convex hull of a set of points / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Comments on a lower bound for convex hull determination / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the complexity of computing the measure of ∪[a <sub>i</sub> ,b <sub>i</sub> ] / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An efficient algorithm for determining the convex hull of a finite planar set / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the \(\Omega (n\log n)\) lower bound for convex hull and maximal vector determination / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Lower Bound to Finding Convex Hulls / rank | |||
Normal rank | |||
Latest revision as of 13:29, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of finding the convex hull of a set of points |
scientific article |
Statements
On the complexity of finding the convex hull of a set of points (English)
0 references
1982
0 references
n log n lower bound
0 references
linear decision tree algorithms
0 references
0 references
