HullGenerator four different implementations:
Vector2s that can then be used to create a
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.
- William Bittle
Interface Summary Interface Description HullGeneratorRepresents an algorithm used to create a convex hull of a given point set.
Class Summary Class Description DivideAndConquerImplementation of the Divide and Conquer convex hull algorithm. GiftWrapImplementation of the Gift Wrapping convex hull algorithm. GrahamScanImplementation of the Graham Scan convex hull algorithm. LinkedVertexRepresents a vertex that is linked to its next and previous vertices. LinkedVertexHullRepresents a convex hull of
MinXYPointComparatorRepresents a comparator that sorts points by their x coordinate lowest to highest then by the y coordinate lowest to highest. MonotoneChainImplementation of the Andrew's Monotone Chain convex hull algorithm. ReferencePointComparatorComparator class to compare points by their angle from the positive x-axis with reference from a given point.