Two remarks on a convex hull algorithm☆
References (1)
On the identification of the convex hull of a finite set of points in the plane
Information Processing Letters
(1973)
Cited by (16)
Differential Morphological Profile on remote sensing images for vegetation mapping in a semi-arid region of the Algerian Saharan Atlas
2021, Journal of Arid EnvironmentsLPCN: Least polar-angle connected node algorithm to find a polygon hull in a connected euclidean graph
2017, Journal of Network and Computer ApplicationsThe attractor-wrapping approach to approximating convex hulls of 2D affine IFS attractors
2009, Computers and Graphics (Pergamon)Citation Excerpt :Moreover, given a set of probabilities, the center is computed in constant time as a unique solution of a system of linear equations. Below we briefly recall a version of the gift-wrapping approach due to Akl [25] which underlies the adaptation of the technique to IFS attractors presented further. Moreover, in general case such a polygonal approximation might have arbitrarily short edges regardless of the required approximation accuracy.
Tomomorphometric analysis of a recent volcanic cone: Misti (Peru)
1998, Comptes Rendus de l'Academie de Sciences - Serie IIa: Sciences de la Terre et des PlanetesParallel solutions to geometric problems in the scan model of computation
1994, Journal of Computer and System SciencesAnother efficient algorithm for convex hulls in two dimensions
1979, Information Processing Letters
- ☆
This work was supported in part by the National Research Council of Canada under Grant NRC-A3599.
Copyright © 1989 Published by Elsevier B.V.