A historical note on convex hull finding algorithms
- 31 January 1985
- journal article
- Published by Elsevier in Pattern Recognition Letters
- Vol. 3 (1) , 21-28
- https://doi.org/10.1016/0167-8655(85)90038-8
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- An efficient algorith for determining the convex hull of a finite planar setPublished by Elsevier ,2002
- Finding the convex hull of a simple polygonJournal of Algorithms, 1983
- A counterexample to an algorithm for computing monotone hulls of simple polygonsPattern Recognition Letters, 1983
- On a convex hull algorithm for polygons and its application to triangulation problemsPattern Recognition, 1982
- Finding the convex hull of a simple polygonPattern Recognition Letters, 1982
- A linear algorithm for finding the convex hull of a simple polygonInformation Processing Letters, 1979
- Convex hull of a finite set of points in two dimensionsInformation Processing Letters, 1978
- A fast convex hull algorithmInformation Processing Letters, 1978
- A New Convex Hull Algorithm for Planar SetsACM Transactions on Mathematical Software, 1977
- Measuring Concavity on a Rectangular MosaicIEEE Transactions on Computers, 1972