Returns the indexes of supplied points, x and y, ordered either clockwise or anticlockwise about another point, which by default is taken to be the non-weighted midpoint of the supplied data
Returns the sequence of indexes within the supplied numeric vectors x and y, that describe the convex hull containing those points. This is a (slightly modified) implementation of the Andrews Monotone Chain, which is a well known algorithm that is able to solve the convex hull with O(nlogn) complexity. Typical computation time on a Macbook Air, 1.7Ghz I7, 8Gb Ram, using random points in the range [0,1]:
Retrieves the Delaunay Mesh for a series of x and y points in 2D. With the exception of a few brief checks, is almost a direct wrapper to the delaunayn function as part of the geometry package.
convexHullAM
(Package: contoureR) :
Convex Hull via Andrews Monotone, Rcpp Interface to C++ Routine
This function is the R interface to the C++ implementation of Andrews Monotone, a well known algorithm for solving the convex hull in O(nlogn) time complexity.
The following routine produces contour lines for a set of non-regular x,y and z values. via utilizing a Deleaunay Mesh strung between the supplied x,y coordinates in order to produce iso-contour data representing the third variable, z. To this end, by using a Deleaunay mesh, this routine does not require regular x and y data, although it can be expected to yield 'better' result, with regular / fine-grained data.
providing 
.