A note on finding convex hulls via maximal vectors
- 1 August 1980
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 11 (1) , 53-56
- https://doi.org/10.1016/0020-0190(80)90036-8
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- An efficient algorith for determining the convex hull of a finite planar setPublished by Elsevier ,2002
- On the Average Number of Maxima in a Set of Vectors and ApplicationsJournal of the ACM, 1978
- Divide and conquer for linear expected timeInformation Processing Letters, 1978
- A New Convex Hull Algorithm for Planar SetsACM Transactions on Mathematical Software, 1977
- Convex hulls of finite sets of points in two and three dimensionsCommunications of the ACM, 1977
- Geometric complexityPublished by Association for Computing Machinery (ACM) ,1975
- On the identification of the convex hull of a finite set of points in the planeInformation Processing Letters, 1973
- Sur L'enveloppe convexe des nuages de points aleatoires dans Rn. IJournal of Applied Probability, 1970
- ZufÄllige konvexe Polygone in einem RinggebietProbability Theory and Related Fields, 1968