Fast linear expected-time algorithms for computing maxima and convex hulls
- 1 February 1993
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 9 (2) , 168-183
- https://doi.org/10.1007/bf01188711
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- An efficient algorith for determining the convex hull of a finite planar setPublished by Elsevier ,2002
- Applications of random sampling in computational geometry, IIDiscrete & Computational Geometry, 1989
- Analysis of a simple yet efficient convex hull algorithmPublished by Association for Computing Machinery (ACM) ,1988
- Optimal Expected-Time Algorithms for Closest Point ProblemsACM Transactions on Mathematical Software, 1980
- A note on finding convex hulls via maximal vectorsInformation Processing Letters, 1980
- Multidimensional divide-and-conquerCommunications of the ACM, 1980
- 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
- On Finding the Maxima of a Set of VectorsJournal of the ACM, 1975
- Expected time bounds for selectionCommunications of the ACM, 1975