[name]

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].

Constructor

[name]()

Properties

[property:VertexList assigned]

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

[property:Array faces]

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

[property:Array newFaces]

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

[property:Float tolerance]

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.

[property:VertexList unassigned]

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

[property:Array vertices]

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

Methods

[method:HalfEdge addAdjoiningFace]( [param:VertexNode eyeVertex], [param:HalfEdge horizonEdge] )

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

[method:ConvexHull addNewFaces]( [param:VertexNode eyeVertex], [param:HalfEdge horizonEdge] )

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

[method:ConvexHull addVertexToFace]( [param:VertexNode vertex], [param:Face face] )

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

[method:ConvexHull addVertexToHull]( [param:VertexNode eyeVertex] )

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.

[method:ConvexHull cleanup]()

Cleans up internal properties after computing the convex hull.

[method:ConvexHull compute]()

Starts the execution of the quick hull algorithm.

[method:Object computeExtremes]()

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

[method:ConvexHull computeHorizon]( [param:Vector3 eyePoint], [param:HalfEdge crossEdge], [param:Face face], [param:Array horizon] )

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'.

[method:ConvexHull computeInitialHull]()

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

[method:ConvexHull containsPoint]( [param:Vector3 point] )

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

[method:ConvexHull deleteFaceVertices]( [param:Face face], [param:Face absorbingFace] )

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.

[method:Vector3 intersectRay]( [param:Ray ray], [param:Vector3 target] )

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

[method:Boolean intersectsRay]( [param:Ray ray] )

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

[method:ConvexHull makeEmpty]()

Makes this convex hull empty.

[method:VertexNode nextVertexToAdd]()

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.

[method:ConvexHull reindexFaces]()

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

[method:VertexNode removeAllVerticesFromFace]( [param:Face face] )

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

[method:ConvexHull removeVertexFromFace]( [param:VertexNode vertex], [param:Face 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.

[method:ConvexHull resolveUnassignedPoints]( [param:Array newFaces] )

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

[method:ConvexHull setFromObject]( [param:Object3D object] )

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

[method:ConvexHull setFromPoints]( [param:Array points] )

Computes to convex hull for the given array of points.

Source

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