Namespace Alis.Core.Physic.Common.ConvexHull
Classes
- ChainHull
-
Andrew's Monotone Chain Convex Hull algorithm. Used to get the convex hull of a point cloud. Source: http://www.softsurfer.com/Archive/algorithm_0109/algorithm_0109.htm
- 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:
- Vertices must be of a simple polygon, i.e. edges do not overlap.
- Melkman does not work on point clouds
- ChainHull.PointComparer
-
The point comparer class