Computes the subset of points which lie on the convex hull of the set of points specified.

1 |

`x, y` |
coordinate vectors of points. This can be specified as two
vectors |

`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.

`xy.coords`

, `polygon`

1 2 3 4 5 6 7 8 9 10 |

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

Please suggest features or report bugs with the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.