How to reduce the average complexity of convex hull finding algorithms (Q1151049): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1242411
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Luc P. Devroye / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0898-1221(81)90059-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036621183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast convex hull algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten / rank
 
Normal rank
Property / cites work
 
Property / cites work: �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: The convex hull of a random set of points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5512519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Die konvexe H�lle von n rotationssymmetrisch verteilten Punkten / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subadditive ergodic theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4135799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Distribution of the Number of Admissible Points in a Vector Random Sample / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on finding convex hulls via maximal vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the identification of the convex hull of a finite set of points in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3230522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur la distribution limite du terme maximum d'une série aléatoire / 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: Convex hulls of finite sets of points in two and three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Average Number of Maxima in a Set of Vectors and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628978 / 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: A Lower Bound to Finding Convex Hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divide and conquer for linear expected time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform convergence of the empirical distribution function over convex sets / rank
 
Normal rank

Latest revision as of 10:52, 13 June 2024

scientific article
Language Label Description Also known as
English
How to reduce the average complexity of convex hull finding algorithms
scientific article

    Statements

    How to reduce the average complexity of convex hull finding algorithms (English)
    0 references
    1981
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references