A convex hull class. Implements the Quickhull algorithm by: Dirk Gregorius. March 2014, Game Developers Conference: [link:http://media.steampowered.com/apps/valve/2014/DirkGregorius_ImplementingQuickHull.pdf Implementing QuickHull].

Creates a new instance of [name].

This [page:VertexList vertex list] holds all vertices that are assigned to a face. Default is an empty vertex list.

The generated faces of the convex hull. Default is an empty array.

This array holds the faces that are generated within a single iteration. Default is an empty array.

The epsilon value that is used for internal comparative operations. The calculation of this value depends on the size of the geometry. Default is -1.

This [page:VertexList vertex list] holds all vertices that are not assigned to a face. Default is an empty vertex list.

The internal representation of the given geometry data (an array of [page:VertexNode vertices]).

[page:VertexNode eyeVertex] - The vertex that is added to the hull.

[page:HalfEdge horizonEdge] - A single edge of the horizon.

Creates a face with the vertices 'eyeVertex.point', 'horizonEdge.tail' and 'horizonEdge.head' in CCW order.
All the half edges are created in CCW order thus the face is always pointing outside the hull

[page:VertexNode eyeVertex] - The vertex that is added to the hull.

[page:HalfEdge horizon] - An array of half-edges that form the horizon.

Adds 'horizon.length' faces to the hull, each face will be linked with the horizon opposite face and the face on the left/right.

[page:VertexNodeNode vertex] - The vertex to add.

[page:Face face] - The target face.

Adds a vertex to the 'assigned' list of vertices and assigns it to the given face.

[page:VertexNode eyeVertex] - The vertex that is added to the hull.

Adds a vertex to the hull with the following algorithm

- Compute the 'horizon' which is a chain of half edges. For an edge to belong to this group it must be the edge connecting a face that can see 'eyeVertex' and a face which cannot see 'eyeVertex'.
- All the faces that can see 'eyeVertex' have its visible vertices removed from the assigned vertex list.
- A new set of faces is created with each edge of the 'horizon' and 'eyeVertex'. Each face is connected with the opposite horizon face and the face on the left/right.
- The vertices removed from all the visible faces are assigned to the new faces if possible.

Cleans up internal properties after computing the convex hull.

Starts the execution of the quick hull algorithm.

Computes the extremes values (min/max vectors) which will be used to compute the inital hull.

[page:Vector3 eyePoint] - The 3D-coordinates of a point.

[page:HalfEdge crossEdge] - The edge used to jump to the current face.

[page:Face face] - The current face being tested.

[page:Array horizon] - The edges that form part of the horizon in CCW order.

Computes a chain of half edges in CCW order called the 'horizon'. For an edge to be part of the horizon it must join a face that can see 'eyePoint' and a face that cannot see 'eyePoint'.

Computes the initial simplex assigning to its faces all the points that are candidates to form part of the hull.

[page:Vector3 point] - A point in 3D space.

Returns *true* if the given point is inside this convex hull.

[page:Face face] - The given face.

[page:Face absorbingFace] - An optional face that tries to absorb the vertices of the first face.

Removes all the visible vertices that 'face' is able to see.

- If 'absorbingFace' doesn't exist, then all the removed vertices will be added to the 'unassigned' vertex list.
- If 'absorbingFace' exists, then this method will assign all the vertices of 'face' that can see 'absorbingFace'.
- If a vertex cannot see 'absorbingFace', it's added to the 'unassigned' vertex list.

[page:Ray ray] - The given ray.

[page:Vector3 target] - The target vector representing the intersection point.

Performs a ray intersection test with this convext hull. If no intersection is found, *null* is returned.

[page:Ray ray] - The given ray.

Returns *true* if the given ray intersects with this convex hull.

Makes this convex hull empty.

Finds the next vertex to create faces with the current hull.

- Let the initial face be the first face existing in the 'assigned' vertex list.
- If a face doesn't exist then return since there're no vertices left.
- Otherwise for each vertex that face sees find the one furthest away from it.

Removes inactive (e.g. deleted) faces from the internal face list.

[page:Face face] - The given face.

Removes all the visible vertices that a given face is able to see which are stored in the 'assigned' vertext list.

[page:VertexNode vertex] - The vertex to remove.

[page:Face face] - The target face.

Removes a vertex from the 'assigned' list of vertices and from the given face. It also makes sure that the link from 'face' to the first vertex it sees in 'assigned' is linked correctly after the removal.

[page:Face newFaces] - An array of new faces.

Reassigns as many vertices as possible from the unassigned list to the new faces.

[page:Object3D object] - [page:Object3D] to compute the convex hull of.

Computes the convex hull of an [page:Object3D] (including its children),accounting for the world transforms of both the object and its childrens.

[page:Array points] - Array of [page:Vector3 Vector3s] that the resulting convex hull will contain.

Computes to convex hull for the given array of points.

[link:https://github.com/mrdoob/three.js/blob/master/examples/jsm/math/ConvexHull.js examples/jsm/math/ConvexHull.js]