On the complexity of finding the convex hull of a set of points (Q1158971): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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

    Identifiers