On the ultimate convex hull algorithm in practice
- 1 January 1985
- journal article
- Published by Elsevier in Pattern Recognition Letters
- Vol. 3 (1) , 29-34
- https://doi.org/10.1016/0167-8655(85)90039-x
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- An efficient algorith for determining the convex hull of a finite planar setPublished by Elsevier ,2002
- Über Algorithmen mit mittlerem linearen Zeitbedarf zur Bestimmung der konvexen HülleComputing, 1981
- On the Ω(n log n) lower bound for convex hull and maximal vector determinationInformation Processing Letters, 1980
- An optimal real-time algorithm for planar convex hullsCommunications of the ACM, 1979
- A fast convex hull algorithmInformation Processing Letters, 1978
- Divide and conquer for linear expected timeInformation Processing Letters, 1978
- Algorithm 523: CONVEX, A New Convex Hull Algorithm for Planar Sets [Z]ACM Transactions on Mathematical Software, 1977
- A New Convex Hull Algorithm for Planar SetsACM Transactions on Mathematical Software, 1977
- Time bounds for selectionJournal of Computer and System Sciences, 1973
- On the identification of the convex hull of a finite set of points in the planeInformation Processing Letters, 1973