Compute Convex Hull of a Set of Points
Computes the subset of points which lie on the convex hull of the set of points specified.
coordinate vectors of points. This can be specified as two
xy.coords is used to interpret the specification of the
points. Infinite, missing and
NaN values are not allowed.
The algorithm is that given by Eddy (1977).
An integer vector giving the indices of the unique points lying on the convex hull, in clockwise order. (The first will be returned for duplicate points.)
Becker, R. A., Chambers, J. M. and Wilks, A. R. (1988) The New S Language. Wadsworth & Brooks/Cole.
Eddy, W. F. (1977) A new convex hull algorithm for planar sets. ACM Transactions on Mathematical Software, 3, 398–403.
Eddy, W. F. (1977) Algorithm 523. CONVEX, A new convex hull algorithm for planar sets[Z]. ACM Transactions on Mathematical Software, 3, 411–412.
1 2 3 4 5 6 7 8 9 10
Want to suggest features or report bugs for rdrr.io? Use the GitHub issue tracker.