GiftWrap (dyn4j 4.0.0 API)

Object
- GiftWrap

All Implemented Interfaces:

HullGenerator
```
public class GiftWrap
extends Object
implements HullGenerator
```
Implementation of the Gift Wrapping convex hull algorithm.
This algorithm handles coincident and colinear points by ignoring them during processing. This ensures the produced hull will not have coincident or colinear vertices.
This algorithm is O(nh) worst case where n is the number of points and h is the number of sides in the resulting convex hull.

Since:

2.2.0

Version:

3.4.0

Author:

William Bittle

Constructor Summary

Constructors
Constructor Description

GiftWrap()

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method	Description
`Vector2[]`	`generate(Vector2... points)`	Returns a convex hull generated from the given point set in counter-clockwise point order.

Methods inherited from class Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- Constructor Detail
  - GiftWrap
```
public GiftWrap()
```
- Method Detail
  - generate
```
public Vector2[] generate(Vector2... points)
```
    Description copied from interface: HullGenerator
    
    Returns a convex hull generated from the given point set in counter-clockwise point order.
    Returns null if the given points array is null.
    Returns the array unchanged if the length is less than or equal to 2.
    
    Specified by:
    
    generate in interface HullGenerator
    
    Parameters:
    
    points - the point set or cloud
    
    Returns:
    
    Vector2[] the convex hull vertices