Module org.dyn4j
Package org.dyn4j.geometry.hull
This package contains algorithms used to create convex hulls of point clouds.
HullGenerator
four different implementations:
Vector2
[]s that can then be used to create a
Convex
Shape
.
Algorithms implementing this interface are intended for general use but does not imply that the results produced would be appropriate for the core dyn4j engine.
All algorithms should produce a valid convex hull that encapsulates all the given points, but there's no guarantee that the algorithms produce identical results.
 Since:
 2.2.0
 Version:
 3.4.0
 Author:
 William Bittle

Interface Summary Interface Description HullGenerator Represents an algorithm used to create a convex hull of a given point set. 
Class Summary Class Description DivideAndConquer Implementation of the Divide and Conquer convex hull algorithm.GiftWrap Implementation of the Gift Wrapping convex hull algorithm.GrahamScan Implementation of the Graham Scan convex hull algorithm.LinkedVertex Represents a vertex that is linked to its next and previous vertices.LinkedVertexHull Represents a convex hull ofLinkedVertex
es.MinXYPointComparator Represents a comparator that sorts points by their x coordinate lowest to highest then by the y coordinate lowest to highest.MonotoneChain Implementation of the Andrew's Monotone Chain convex hull algorithm.ReferencePointComparator Comparator class to compare points by their angle from the positive xaxis with reference from a given point.