| Name | Description |
|---|---|
| GiftWrap | Giftwrap convex hull algorithm. O(nh) time complexity, where n is the number of points and h is the number of points on the convex hull. See http://en.wikipedia.org/wiki/Gift_wrapping_algorithm for more details. |
| Melkman | Creates a convex hull. Note: 1. Vertices must be of a simple polygon, i.e. edges do not overlap. 2. Melkman does not work on point clouds |
