𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the performance of peeling algorithms

✍ Scribed by Petitjean, Michel ;Saporta, Gilbert

Publisher
John Wiley and Sons
Year
1992
Tongue
English
Weight
453 KB
Volume
8
Category
Article
ISSN
8755-0024

No coin nor oath required. For personal study only.

✦ Synopsis

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; an O(n^Λ™^n) convex hull algorithm, m being the number of extremal points, is shown to peel every set with an O(n‐n) time, and proved to be optimal; an implementation of this algorithm is given for planar sets and spatial sets, but the latter give only an approximate O(n^Λ™^n) performance.

πŸ“œ SIMILAR VOLUMES

On Assessing the Performance of Randomiz
On Assessing the Performance of Randomized Algorithms
✍ Sorana Froda πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 145 KB

In this paper we study randomized algorithms with random input. We adapt to such algorithms the notion of probability of a false positive which is common in epidemiological studies. The probability of a false positive takes into account both the (controlled) error of the randomization and the random

The impact of approximate evaluation on
The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling
✍ Watson, J. P. (author);Rana, S. (author);Whitley, L. D. (author);Howe, A. E. (au πŸ“‚ Article πŸ“… 1999 πŸ› Springer Netherlands 🌐 English βš– 254 KB πŸ‘ 2 views

The Coors warehouse scheduling problem involves finding a permutation of customer orders that minimizes the average time that customers' orders spend at the loading docks while at the same time minimizing the running average inventory, Search-based solutions require fast objective functions. Thus, a

Performance Characterization of Image St
Performance Characterization of Image Stabilization Algorithms
✍ Stephen B. Balakirsky; Rama Chellappa πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 316 KB

## Performance Characterization of Image Stabilization Algorithms his paper compares three image stabilization algorithms when used as preprocessors for a target tracking application. These algorithms vary in computational complexity, accuracy, and ability. TAl gorithm 1 is capable of only pixel-