On the performance of peeling algorithms
- 1 June 1992
- journal article
- research article
- Published by Wiley in Applied Stochastic Models and Data Analysis
- Vol. 8 (2) , 91-98
Abstract
No abstract availableKeywords
This publication has 42 references indexed in Scilit:
- Computational Geometry1985
- Optimal parallel algorithms for computing convex hulls and for sortingComputing, 1984
- A constant-time parallel algorithm for computing convex hullsBIT Numerical Mathematics, 1982
- A Lower Bound to Finding Convex HullsJournal of the ACM, 1981
- Another efficient algorithm for convex hulls in two dimensionsInformation Processing Letters, 1979
- On the Average Number of Maxima in a Set of Vectors and ApplicationsJournal of the ACM, 1978
- A fast convex hull algorithmInformation Processing Letters, 1978
- A reevaluation of an efficient algorithm for determining the convex hull of a finite planar setInformation Processing Letters, 1978
- The Ordering of Multivariate DataJournal of the Royal Statistical Society. Series A (General), 1976
- An Algorithm for Convex PolytopesJournal of the ACM, 1970