Description Usage Arguments Value References Examples

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]:

100K points 0.03 Seconds

1M points 0.3 seconds, and

10M points3.3 seconds.

1 | ```
getConvexHull(x, y, includeColinear = FALSE)
``` |

`x` |
numeric vector of x values |

`y` |
numeric vector of y values of same length as x |

`includeColinear` |
keep or discard the points that lie |

Returns a vector of integers that represent the '1-based' indexes of the points relative to the
`x`

and `y`

input arguments. The resulting vector represents the **closed** list, meaning that the
first index and the last index in the series will be the same.

https://en.wikibooks.org/wiki/Algorithm_Implementation/Geometry/Convex_hull/Monotone_chain

1 2 3 4 5 6 7 8 9 10 11 12 |

```
Loading required package: geometry
Loading required package: magic
Loading required package: abind
```

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.