On the performance of peeling algorithms
β
Petitjean, Michel ;Saporta, Gilbert
π
Article
π
1992
π
John Wiley and Sons
π
English
β 453 KB
## Abstract The peeling of a __d__βdimensional set of points is usually performed with successive calls to a convex hull algorithm; the optimal worstβcase convex hull algorithm, known to have an __O__(__n__^Λ^ Log (n)) execution time, may give an __O__(__n__^Λ^__n__^Λ^ Log (n)) to peel all the set;