diff --git a/docs/examples/geometries/ConvexBufferGeometry.html b/docs/examples/geometries/ConvexBufferGeometry.html
new file mode 100644
index 0000000000000000000000000000000000000000..77b255b719d7e70008dd0bbaac05819dd5f2e869
--- /dev/null
+++ b/docs/examples/geometries/ConvexBufferGeometry.html
@@ -0,0 +1,55 @@
+
+
+
+ [name]
+
+ [name] can be used to generate a convex hull for a given array of 3D points.
+ The average time complexity for this task is considered to be O(nlog(n)).
+
+
+
+ Example
+
+ var geometry = new THREE.ConvexBufferGeometry( points );
+ var material = new THREE.MeshBasicMaterial( {color: 0x00ff00} );
+ var mesh = new THREE.Mesh( geometry, material );
+ scene.add( mesh );
+
+
+ Constructor
+
+ [name]( [page:Array points] )
+
+ points — Array of [page:Vector3 Vector3s] that the resulting convex hull will contain.
+
+
+
+ Source
+
+ [link:https://github.com/mrdoob/three.js/blob/master/examples/js/geometries/ConvexGeometry.js examples/js/geometries/ConvexGeometry.js]
+
+
diff --git a/docs/examples/geometries/ConvexGeometry.html b/docs/examples/geometries/ConvexGeometry.html
new file mode 100644
index 0000000000000000000000000000000000000000..667136acb4431828ab39048c00b72d9ebb4c47bc
--- /dev/null
+++ b/docs/examples/geometries/ConvexGeometry.html
@@ -0,0 +1,54 @@
+
+
+
+ [name]
+
+ [name] can be used to generate a convex hull for a given array of 3D points.
+ The average time complexity for this task is considered to be O(nlog(n)).
+
+
+
+ Example
+
+ var geometry = new THREE.ConvexGeometry( points );
+ var material = new THREE.MeshBasicMaterial( {color: 0x00ff00} );
+ var mesh = new THREE.Mesh( geometry, material );
+ scene.add( mesh );
+
+
+ Constructor
+
+ [name]( [page:Array points] )
+
+ points — Array of [page:Vector3 Vector3s] that the resulting convex hull will contain.
+
+
+
+ Source
+
+ [link:https://github.com/mrdoob/three.js/blob/master/examples/js/geometries/ConvexGeometry.js examples/js/geometries/ConvexGeometry.js]
+
+
diff --git a/docs/examples/quickhull/Face.html b/docs/examples/quickhull/Face.html
new file mode 100644
index 0000000000000000000000000000000000000000..54196fb0321498820b36fe4302028949fa26b5c3
--- /dev/null
+++ b/docs/examples/quickhull/Face.html
@@ -0,0 +1,89 @@
+
+
+
+ [name]
+
+
+ Represents a section bounded by a specific amount of half-edges. The current implmentation assumes that a face always consist of three edges.
+
+
+
+ Constructor
+
+
+ [name]()
+
+
+
+ Properties
+
+ [property:Vector3 normal]
+
+ The normal vector of the face. Default is a [page:Vector3] at (0, 0, 0).
+
+
+ [property:Vector3 midpoint]
+
+ The midpoint or centroid of the face. Default is a [page:Vector3] at (0, 0, 0).
+
+
+ [property:Float area]
+
+ The area of the face. Default is 0.
+
+
+ [property:Float constant]
+
+ Signed distance from face to the origin. Default is 0.
+
+
+ [property:VertexNode outside]
+
+ Reference to a vertex in a vertex list this face can see. Default is null.
+
+
+ [property:Integer mark]
+
+ Marks if a face is visible or deleted. Default is 'Visible'.
+
+
+ [property:HalfEdge edge]
+
+ Reference to the base edge of a face. To retrieve all edges, you can use the 'next' reference of the current edge. Default is null.
+
+
+ Methods
+
+ [method:Face create]( [page:VertexNode a], [page:VertexNode b], [page:VertexNode c] )
+ [page:VertexNode a] - First vertex of the face.Creates a face.
+
+ [method:HalfEdge getEdge]( [page:Integer i] )
+ [page:Integer i] - The index of the edge.Returns an edge by the given index.
+
+ [method:Face compute] ()
+
+ Computes all properties of the face.
+
+ [method:Float distanceToPoint]( [page:Vector3 point] )
+ [page:Vector3 point] - Any point in 3D space.Returns the signed distance from a given point to the plane representation of this face.
+
+ Source
+
+ [link:https://github.com/mrdoob/three.js/blob/master/examples/js/QuickHull.js examples/js/QuickHull.js]
+
+
diff --git a/docs/examples/quickhull/HalfEdge.html b/docs/examples/quickhull/HalfEdge.html
new file mode 100644
index 0000000000000000000000000000000000000000..b00281cbde2c847d3c58aa3cfb83433493f645af
--- /dev/null
+++ b/docs/examples/quickhull/HalfEdge.html
@@ -0,0 +1,79 @@
+
+
+
+ [name]
+
+
+ The basis for a half-edge data structure, also known as doubly connected edge list (DCEL).
+
+
+ Constructor
+
+
+ [name]( [page:VertexNode vertex], [page:Face face] )
+ [page:VertexNode vertex] - [page:VertexNode] A reference to its destination vertex.Properties
+
+ [property:VertexNode vertex]
+
+ Reference to the destination vertex. The origin vertex can be obtained by querying the destination of its twin, or of the previous half-edge. Default is undefined.
+
+
+ [property:HalfEdge prev]
+
+ Reference to the previous half-edge of the same face. Default is null.
+
+
+ [property:HalfEdge next]
+
+ Reference to the next half-edge of the same face. Default is null.
+
+
+ [property:HalfEdge twin]
+
+ Reference to the twin half-edge to reach the opposite face. Default is null.
+
+
+ [property:Face face]
+
+ Each half-edge bounds a single face and thus has a reference to that face. Default is undefined.
+
+
+ Methods
+
+ [method:VertexNode head]()
+ Returns the destintation vertex.
+
+ [method:VertexNode tail]()
+ Returns the origin vertex.
+
+ [method:Float length]()
+ Returns the [link:https://en.wikipedia.org/wiki/Euclidean_distance Euclidean length]
+ (straight-line length) of the edge.
+
+ [method:Float lengthSquared]()
+ Returns the square of the [link:https://en.wikipedia.org/wiki/Euclidean_distance Euclidean length]
+ (straight-line length) of the edge.
+
+ [method:HalfEdge setTwin]( [page:HalfEdge edge] )
+ [page:HalfEdge edge] - Any half-edge.Sets the twin edge of this half-edge. It also ensures that the twin reference of the given half-edge is correctly set.
+
+ Source
+
+ [link:https://github.com/mrdoob/three.js/blob/master/examples/js/QuickHull.js examples/js/QuickHull.js]
+
+
diff --git a/docs/examples/quickhull/QuickHull.html b/docs/examples/quickhull/QuickHull.html
new file mode 100644
index 0000000000000000000000000000000000000000..b6963c1afaa3b78aa31cc83b1f19d573f6b858d2
--- /dev/null
+++ b/docs/examples/quickhull/QuickHull.html
@@ -0,0 +1,175 @@
+
+
+
+ [name]
+
+
+ General information about the Quickhull algorithm: Dirk Gregorius. March 2014, Game Developers Conference: [link:http://media.steampowered.com/apps/valve/2014/DirkGregorius_ImplementingQuickHull.pdf Implementing QuickHull].
+
+
+
+ Constructor
+
+
+ [name]()
+
+
+
+ Properties
+
+ [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: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:VertexList assigned]
+
+ This [page:VertexList vertex list] holds all vertices that are assigned to a face. Default is an empty vertex list.
+
+
+ [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:QuickHull setFromPoints]( [page:Array points] )
+ [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.
+
+ [method:QuickHull setFromObject]( [page:Object3D object] )
+ [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.
+
+ [method:QuickHull makeEmpty]()
+
+ Makes this convex hull empty.
+
+ [method:QuickHull addVertexToFace]( [page:VertexNode vertex], [page:Face face] )
+ [page:VertexNodeNode vertex] - The vetex to add.Adds a vertex to the 'assigned' list of vertices and assigns it to the given face.
+
+ [method:QuickHull removeVertexFromFace]( [page:VertexNode vertex], [page:Face face] )
+ [page:VertexNode vertex] - The vetex to remove.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:VertexNode removeAllVerticesFromFace]( [page:Face face] )
+ [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.
+
+ [method:QuickHull deleteFaceVertices]( [page:Face face], [page:Face absorbingFace] )
+ [page:Face face] - The given 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.
+
+
[method:QuickHull resolveUnassignedPoints]( [page:Array newFaces] )
+ [page:Face newFaces] - An array of new faces.Reassigns as many vertices as possible from the unassigned list to the new faces.
+
+ [method:Object computeExtremes]()
+
+ Computes the extremes values (min/max vectors) which will be used to compute the inital hull.
+
+ [method:QuickHull computeInitialHull]()
+
+ Computes the initial simplex assigning to its faces all the points that are candidates to form part of the hull.
+
+ [method:QuickHull reindexFaces]()
+
+ Removes inactive (e.g. deleted) faces from the internal face list.
+
+ [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:QuickHull computeHorizon]( [page:Vector3 eyePoint], [page:HalfEdge crossEdge], [page:Face face], [page:Array horizon] )
+ [page:Vector3 eyePoint] - The 3D-coordinates of a point.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:HalfEdge addAdjoiningFace]( [page:VertexNode eyeVertex], [page:HalfEdge horizonEdge] )
+ [page:VertexNode eyeVertex] - The vertex that is added to the hull.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:QuickHull addNewFaces]( [page:VertexNode eyeVertex], [page:HalfEdge horizonEdge] )
+ [page:VertexNode eyeVertex] - The vertex that is added to the hull.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:QuickHull addVertexToHull]( [page:VertexNode eyeVertex] )
+ [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.
+
+
[method:QuickHull cleanup]()
+
+ Cleans up internal properties after computing the convex hull.
+
+ [method:QuickHull compute]()
+
+ Starts the execution of the quick hull algorithm.
+
+ Source
+
+ [link:https://github.com/mrdoob/three.js/blob/master/examples/js/QuickHull.js examples/js/QuickHull.js]
+
+
diff --git a/docs/examples/quickhull/VertexList.html b/docs/examples/quickhull/VertexList.html
new file mode 100644
index 0000000000000000000000000000000000000000..e975195bd412e913ea3932159408b8d4435cf546
--- /dev/null
+++ b/docs/examples/quickhull/VertexList.html
@@ -0,0 +1,89 @@
+
+
+
+ [name]
+
+
+ A doubly linked list of vertices.
+
+
+
+ Constructor
+
+
+ [name]()
+
+
+
+ Properties
+
+ [property:VertexNode head]
+
+ Reference to the first vertex of the linked list. Default is null.
+
+
+ [property:VertexNode tail]
+
+ Reference to the last vertex of the linked list. Default is null.
+
+
+ Methods
+
+ [method:VertexNode first]()
+ Returns the head reference.
+
+ [method:VertexNode last]()
+ Returns the tail reference.
+
+ [method:VertexList clear]()
+ Clears the linked list.
+
+ [method:VertexList insertBefore]( [page:Vertex target], [page:Vertex vertex] )
+ [page:Vertex target] - The target vertex. It's assumed that this vertex belongs to the linked list.Inserts a vertex before a target vertex.
+
+ [method:VertexList insertAfter]( [page:Vertex target], [page:Vertex vertex] )
+ [page:Vertex target] - The target vertex. It's assumed that this vertex belongs to the linked list.Inserts a vertex after a target vertex.
+
+ [method:VertexList append]( [page:Vertex vertex] )
+ [page:Vertex vertex] - The vertex to append.Appends a vertex to the end of the linked list.
+
+ [method:VertexList appendChain]( [page:Vertex vertex] )
+ [page:Vertex vertex] - The head vertex of a chain of vertices.Appends a chain of vertices where the given vertex is the head.
+
+ [method:VertexList remove]( [page:Vertex vertex] )
+ [page:Vertex vertex] - The vertex to remove.Removes a vertex from the linked list.
+
+ [method:VertexList removeSubList]( [page:Vertex a], [page:Vertex b] )
+ [page:Vertex a] - The head of the sublist.Removes a sublist of vertices from the linked list.
+
+ [method:Boolean isEmpty]()
+
+ Returns true if the linked list is empty.
+
+ Source
+
+ [link:https://github.com/mrdoob/three.js/blob/master/examples/js/QuickHull.js examples/js/QuickHull.js]
+
+
diff --git a/docs/examples/quickhull/VertexNode.html b/docs/examples/quickhull/VertexNode.html
new file mode 100644
index 0000000000000000000000000000000000000000..eb92e4d5c3ee5f2a05e959e43e860f8e6e8f2faa
--- /dev/null
+++ b/docs/examples/quickhull/VertexNode.html
@@ -0,0 +1,52 @@
+
+
+
+ [name]
+
+
+ A vertex as a double linked list node.
+
+
+
+ Constructor
+
+
+ [name]( [page:Vector3 point] )
+ [page:Vector3 point] - [page:Vector3] A point (x, y, z) in 3D space.Properties
+
+ [property:Vector3 point]
+
+ A point (x, y, z) in 3D space. Default is undefined.
+
+
+ [property:VertexNode prev]
+
+ Reference to the previous vertex in the double linked list. Default is null.
+
+
+ [property:VertexNode next]
+
+ Reference to the next vertex in the double linked list. Default is null.
+
+
+ [property:Face face]
+
+ Reference to the face that is able to see this vertex. Default is undefined.
+
+
+ Source
+
+ [link:https://github.com/mrdoob/three.js/blob/master/examples/js/QuickHull.js examples/js/QuickHull.js]
+
+
diff --git a/docs/list.js b/docs/list.js
index 5ba0f6e45527fb8fc4f8484d3c1e15b4464c8fe7..1f2cdb2fa755e08188c633bc7d9e21d87f48f0a5 100644
--- a/docs/list.js
+++ b/docs/list.js
@@ -337,6 +337,11 @@ var list = {
[ "KeyFrameAnimation", "examples/collada/KeyFrameAnimation" ]
],
+ "Geometries": [
+ [ "ConvexBufferGeometry", "examples/geometries/ConvexBufferGeometry" ],
+ [ "ConvexGeometry", "examples/geometries/ConvexGeometry" ]
+ ],
+
"Loaders": [
[ "BabylonLoader", "examples/loaders/BabylonLoader" ],
[ "ColladaLoader", "examples/loaders/ColladaLoader" ],
@@ -355,6 +360,14 @@ var list = {
[ "SpriteCanvasMaterial", "examples/SpriteCanvasMaterial" ]
],
+ "QuickHull": [
+ [ "Face", "examples/quickhull/Face" ],
+ [ "HalfEdge", "examples/quickhull/HalfEdge" ],
+ [ "QuickHull", "examples/quickhull/QuickHull" ],
+ [ "VertexNode", "examples/quickhull/VertexNode" ],
+ [ "VertexList", "examples/quickhull/VertexList" ]
+ ],
+
"Renderers": [
[ "CanvasRenderer", "examples/renderers/CanvasRenderer" ]
]
diff --git a/docs/scenes/js/geometry.js b/docs/scenes/js/geometry.js
index d1222fcf02426c98996cfd092d54f38279100ded..ddc3f114e021eb5e10e6bc9ccbfea3814a00501a 100644
--- a/docs/scenes/js/geometry.js
+++ b/docs/scenes/js/geometry.js
@@ -1330,7 +1330,7 @@ var guis = {
}
- var folder = gui.addFolder( 'THREE.ExtrudeGeometry' );
+ var folder = gui.addFolder( 'THREE.ExtrudeBufferGeometry' );
folder.add( data, 'steps', 1, 10 ).step( 1 ).onChange( generateGeometry );
folder.add( data, 'amount', 1, 20 ).step( 1 ).onChange( generateGeometry );
diff --git a/examples/js/QuickHull.js b/examples/js/QuickHull.js
new file mode 100644
index 0000000000000000000000000000000000000000..5c3ab0cf374b7fe287c7d701fba22f2ef7ca71f7
--- /dev/null
+++ b/examples/js/QuickHull.js
@@ -0,0 +1,1218 @@
+/**
+ * @author Mugen87 / https://github.com/Mugen87
+ *
+ * Ported from: https://github.com/maurizzzio/quickhull3d/ by Mauricio Poppe (https://github.com/maurizzzio)
+ *
+ */
+
+( function() {
+
+ var Visible = 0;
+ var Deleted = 1;
+
+ function QuickHull() {
+
+ this.tolerance = - 1;
+
+ this.faces = []; // the generated faces of the convex hull
+ this.newFaces = []; // this array holds the faces that are generated within a single iteration
+
+ // the vertex lists work as follows:
+ //
+ // let 'a' and 'b' be 'Face' instances
+ // let 'v' be points wrapped as instance of 'Vertex'
+ //
+ // [v, v, ..., v, v, v, ...]
+ // ^ ^
+ // | |
+ // a.outside b.outside
+ //
+ this.assigned = new VertexList();
+ this.unassigned = new VertexList();
+
+ this.vertices = []; // vertices of the hull (internal representation of given geometry data)
+
+ }
+
+ Object.assign( QuickHull.prototype, {
+
+ setFromPoints: function ( points ) {
+
+ if ( Array.isArray( points ) !== true ) {
+
+ console.error( 'THREE.QuickHull: Points parameter is not an array.' );
+
+ }
+
+ if ( points.length < 4 ) {
+
+ console.error( 'THREE.QuickHull: The algorithm needs at least four points.' );
+
+ }
+
+ this.makeEmpty();
+
+ for ( var i = 0, l = points.length; i < l; i ++ ) {
+
+ this.vertices.push( new VertexNode( points[ i ] ) );
+
+ }
+
+ this.compute();
+
+ return this;
+
+ },
+
+ setFromObject: function ( object ) {
+
+ var points = [];
+
+ object.updateMatrixWorld( true );
+
+ object.traverse( function ( node ) {
+
+ var i, l, point;
+
+ var geometry = node.geometry;
+
+ if ( geometry !== undefined ) {
+
+ if ( geometry.isGeometry ) {
+
+ var vertices = geometry.vertices;
+
+ for ( i = 0, l = vertices.length; i < l; i ++ ) {
+
+ point = vertices[ i ].clone();
+ point.applyMatrix4( node.matrixWorld );
+
+ points.push( point );
+
+ }
+
+ } else if ( geometry.isBufferGeometry ) {
+
+ var attribute = geometry.attributes.position;
+
+ if ( attribute !== undefined ) {
+
+ for ( i = 0, l = attribute.count; i < l; i ++ ) {
+
+ point = new THREE.Vector3();
+
+ point.fromBufferAttribute( attribute, i ).applyMatrix4( node.matrixWorld );
+
+ points.push( point );
+
+ }
+
+ }
+
+ }
+
+ }
+
+ } );
+
+ return this.setFromPoints( points );
+
+ },
+
+ makeEmpty: function () {
+
+ this.faces = [];
+ this.vertices = [];
+
+ return this;
+
+ },
+
+ // Adds a vertex to the 'assigned' list of vertices and assigns it to the given face
+
+ addVertexToFace: function ( vertex, face ) {
+
+ vertex.face = face;
+
+ if ( face.outside === null ) {
+
+ this.assigned.append( vertex );
+
+ } else {
+
+ this.assigned.insertBefore( face.outside, vertex );
+
+ }
+
+ face.outside = vertex;
+
+ return this;
+
+ },
+
+ // Removes a vertex from the 'assigned' list of vertices and from the given face
+
+ removeVertexFromFace: function ( vertex, face ) {
+
+ if ( vertex === face.outside ) {
+
+ // fix face.outside link
+
+ if ( vertex.next !== null && vertex.next.face === face ) {
+
+ // face has at least 2 outside vertices, move the 'outside' reference
+
+ face.outside = vertex.next;
+
+ } else {
+
+ // vertex was the only outside vertex that face had
+
+ face.outside = null;
+
+ }
+
+ }
+
+ this.assigned.remove( vertex );
+
+ return this;
+
+ },
+
+ // Removes all the visible vertices that a given face is able to see which are stored in the 'assigned' vertext list
+
+ removeAllVerticesFromFace: function ( face ) {
+
+ if ( face.outside !== null ) {
+
+ // reference to the first and last vertex of this face
+
+ var start = face.outside;
+ var end = face.outside;
+
+ while ( end.next !== null && end.next.face === face ) {
+
+ end = end.next;
+
+ }
+
+ this.assigned.removeSubList( start, end );
+
+ // fix references
+
+ start.prev = end.next = null;
+ face.outside = null;
+
+ return start;
+
+ }
+
+ },
+
+ // Removes all the visible vertices that 'face' is able to see
+
+ deleteFaceVertices: function ( face, absorbingFace ) {
+
+ var faceVertices = this.removeAllVerticesFromFace( face );
+
+ if ( faceVertices !== undefined ) {
+
+ if ( absorbingFace === undefined ) {
+
+ // mark the vertices to be reassigned to some other face
+
+ this.unassigned.appendChain( faceVertices );
+
+
+ } else {
+
+ // if there's an absorbing face try to assign as many vertices as possible to it
+
+ var vertex = faceVertices;
+
+ do {
+
+ // we need to buffer the subsequent vertex at this point because the 'vertex.next' reference
+ // will be changed by upcoming method calls
+
+ var nextVertex = vertex.next;
+
+ var distance = absorbingFace.distanceToPoint( vertex.point );
+
+ // check if 'vertex' is able to see 'absorbingFace'
+
+ if ( distance > this.tolerance ) {
+
+ this.addVertexToFace( vertex, absorbingFace );
+
+ } else {
+
+ this.unassigned.append( vertex );
+
+ }
+
+ // now assign next vertex
+
+ vertex = nextVertex;
+
+ } while ( vertex !== null );
+
+ }
+
+ }
+
+ return this;
+
+ },
+
+ // Reassigns as many vertices as possible from the unassigned list to the new faces
+
+ resolveUnassignedPoints: function ( newFaces ) {
+
+ if ( this.unassigned.isEmpty() === false ) {
+
+ var vertex = this.unassigned.first();
+
+ do {
+
+ // buffer 'next' reference, see .deleteFaceVertices()
+
+ var nextVertex = vertex.next;
+
+ var maxDistance = this.tolerance;
+
+ var maxFace = null;
+
+ for ( var i = 0; i < newFaces.length; i ++ ) {
+
+ var face = newFaces[ i ];
+
+ if ( face.mark === Visible ) {
+
+ var distance = face.distanceToPoint( vertex.point );
+
+ if ( distance > maxDistance ) {
+
+ maxDistance = distance;
+ maxFace = face;
+
+ }
+
+ if ( maxDistance > 1000 * this.tolerance ) break;
+
+ }
+
+ }
+
+ // 'maxFace' can be null e.g. if there are identical vertices
+
+ if ( maxFace !== null ) {
+
+ this.addVertexToFace( vertex, maxFace );
+
+ }
+
+ vertex = nextVertex;
+
+ } while ( vertex !== null );
+
+ }
+
+ return this;
+
+ },
+
+ // Computes the extremes of a simplex which will be the initial hull
+
+ computeExtremes: function () {
+
+ var min = new THREE.Vector3();
+ var max = new THREE.Vector3();
+
+ var minVertices = [];
+ var maxVertices = [];
+
+ var i, l, j;
+
+ // initially assume that the first vertex is the min/max
+
+ for ( i = 0; i < 3; i ++ ) {
+
+ minVertices[ i ] = maxVertices[ i ] = this.vertices[ 0 ];
+
+ }
+
+ min.copy( this.vertices[ 0 ].point );
+ max.copy( this.vertices[ 0 ].point );
+
+ // compute the min/max vertex on all six directions
+
+ for ( i = 0, l = this.vertices.length; i < l ; i ++ ) {
+
+ var vertex = this.vertices[ i ];
+ var point = vertex.point;
+
+ // update the min coordinates
+
+ for ( j = 0; j < 3; j ++ ) {
+
+ if ( point.getComponent( j ) < min.getComponent( j ) ) {
+
+ min.setComponent( j, point.getComponent( j ) );
+ minVertices[ j ] = vertex;
+
+ }
+
+ }
+
+ // update the max coordinates
+
+ for ( j = 0; j < 3; j ++ ) {
+
+ if ( point.getComponent( j ) > max.getComponent( j ) ) {
+
+ max.setComponent( j, point.getComponent( j ) );
+ maxVertices[ j ] = vertex;
+
+ }
+
+ }
+
+ }
+
+ // use min/max vectors to compute an optimal epsilon
+
+ this.tolerance = 3 * Number.EPSILON * (
+ Math.max( Math.abs( min.x ), Math.abs( max.x ) ) +
+ Math.max( Math.abs( min.y ), Math.abs( max.y ) ) +
+ Math.max( Math.abs( min.z ), Math.abs( max.z ) )
+ );
+
+ return { min: minVertices, max: maxVertices };
+
+ },
+
+ // Computes the initial simplex assigning to its faces all the points
+ // that are candidates to form part of the hull
+
+ computeInitialHull: function () {
+
+ var line3, plane, closestPoint;
+
+ return function computeInitialHull () {
+
+ if ( line3 === undefined ) {
+
+ line3 = new THREE.Line3();
+ plane = new THREE.Plane();
+ closestPoint = new THREE.Vector3();
+
+ }
+
+ var vertex, vertices = this.vertices;
+ var extremes = this.computeExtremes();
+ var min = extremes.min;
+ var max = extremes.max;
+
+ var v0, v1, v2, v3;
+ var i, l, j;
+
+ // 1. Find the two vertices 'v0' and 'v1' with the greatest 1d separation
+ // (max.x - min.x)
+ // (max.y - min.y)
+ // (max.z - min.z)
+
+ var distance, maxDistance = 0;
+ var index = 0;
+
+ for ( i = 0; i < 3; i ++ ) {
+
+ distance = max[ i ].point.getComponent( i ) - min[ i ].point.getComponent( i );
+
+ if ( distance > maxDistance ) {
+
+ maxDistance = distance;
+ index = i;
+
+ }
+
+ }
+
+ v0 = min[ index ];
+ v1 = max[ index ];
+
+ // 2. The next vertex 'v2' is the one farthest to the line formed by 'v0' and 'v1'
+
+ maxDistance = 0;
+ line3.set( v0.point, v1.point );
+
+ for ( i = 0, l = this.vertices.length; i < l; i ++ ) {
+
+ vertex = vertices[ i ];
+
+ if ( vertex !== v0 && vertex !== v1 ) {
+
+ line3.closestPointToPoint( vertex.point, true, closestPoint );
+
+ distance = closestPoint.distanceToSquared( vertex.point );
+
+ if ( distance > maxDistance ) {
+
+ maxDistance = distance;
+ v2 = vertex;
+
+ }
+
+ }
+
+ }
+
+ // 3. The next vertex 'v3' is the one farthest to the plane 'v0', 'v1', 'v2'
+
+ maxDistance = 0;
+ plane.setFromCoplanarPoints( v0.point, v1.point, v2.point );
+
+ for ( i = 0, l = this.vertices.length; i < l; i ++ ) {
+
+ vertex = vertices[ i ];
+
+ if ( vertex !== v0 && vertex !== v1 && vertex !== v2 ) {
+
+ distance = Math.abs( plane.distanceToPoint( vertex.point ) );
+
+ if ( distance > maxDistance ) {
+
+ maxDistance = distance;
+ v3 = vertex;
+
+ }
+
+ }
+
+ }
+
+ var faces = [];
+
+ if ( plane.distanceToPoint( v3.point ) < 0 ) {
+
+ // the face is not able to see the point so 'plane.normal' is pointing outside the tetrahedron
+
+ faces.push(
+ Face.create( v0, v1, v2 ),
+ Face.create( v3, v1, v0 ),
+ Face.create( v3, v2, v1 ),
+ Face.create( v3, v0, v2 )
+ );
+
+ // set the twin edge
+
+ for ( i = 0; i < 3; i ++ ) {
+
+ j = ( i + 1 ) % 3;
+
+ // join face[ i ] i > 0, with the first face
+
+ faces[ i + 1 ].getEdge( 2 ).setTwin( faces[ 0 ].getEdge( j ) );
+
+ // join face[ i ] with face[ i + 1 ], 1 <= i <= 3
+
+ faces[ i + 1 ].getEdge( 1 ).setTwin( faces[ j + 1 ].getEdge( 0 ) );
+
+ }
+
+ } else {
+
+ // the face is able to see the point so 'plane.normal' is pointing inside the tetrahedron
+
+ faces.push(
+ Face.create( v0, v2, v1 ),
+ Face.create( v3, v0, v1 ),
+ Face.create( v3, v1, v2 ),
+ Face.create( v3, v2, v0 )
+ );
+
+ // set the twin edge
+
+ for ( i = 0; i < 3; i ++ ) {
+
+ j = ( i + 1 ) % 3;
+
+ // join face[ i ] i > 0, with the first face
+
+ faces[ i + 1 ].getEdge( 2 ).setTwin( faces[ 0 ].getEdge( ( 3 - i ) % 3 ) );
+
+ // join face[ i ] with face[ i + 1 ]
+
+ faces[ i + 1 ].getEdge( 0 ).setTwin( faces[ j + 1 ].getEdge( 1 ) );
+
+ }
+
+ }
+
+ // the initial hull is the tetrahedron
+
+ for ( i = 0; i < 4; i ++ ) {
+
+ this.faces.push( faces[ i ] );
+
+ }
+
+ // initial assignment of vertices to the faces of the tetrahedron
+
+ for ( i = 0, l = vertices.length; i < l; i ++ ) {
+
+ vertex = vertices[i];
+
+ if ( vertex !== v0 && vertex !== v1 && vertex !== v2 && vertex !== v3 ) {
+
+ maxDistance = this.tolerance;
+ var maxFace = null;
+
+ for ( j = 0; j < 4; j ++ ) {
+
+ distance = this.faces[ j ].distanceToPoint( vertex.point );
+
+ if ( distance > maxDistance ) {
+
+ maxDistance = distance;
+ maxFace = this.faces[ j ];
+
+ }
+
+ }
+
+ if ( maxFace !== null ) {
+
+ this.addVertexToFace( vertex, maxFace );
+
+ }
+
+ }
+
+ }
+
+ return this;
+
+ };
+
+ }(),
+
+ // Removes inactive faces
+
+ reindexFaces: function () {
+
+ var activeFaces = [];
+
+ for ( var i = 0; i < this.faces.length; i ++ ) {
+
+ var face = this.faces[ i ];
+
+ if ( face.mark === Visible ) {
+
+ activeFaces.push( face );
+
+ }
+
+ }
+
+ this.faces = activeFaces;
+
+ return this;
+
+ },
+
+ // Finds the next vertex to create faces with the current hull
+
+ nextVertexToAdd: function () {
+
+ // if the 'assigned' list of vertices is empty, no vertices are left. return with 'undefined'
+
+ if ( this.assigned.isEmpty() === false ) {
+
+ var eyeVertex, maxDistance = 0;
+
+ // grap the first available face and start with the first visible vertex of that face
+
+ var eyeFace = this.assigned.first().face;
+ var vertex = eyeFace.outside;
+
+ // now calculate the farthest vertex that face can see
+
+ do {
+
+ var distance = eyeFace.distanceToPoint( vertex.point );
+
+ if ( distance > maxDistance ) {
+
+ maxDistance = distance;
+ eyeVertex = vertex;
+
+ }
+
+ vertex = vertex.next;
+
+ } while ( vertex !== null && vertex.face === eyeFace );
+
+ return eyeVertex;
+
+ }
+
+ },
+
+ // 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'.
+
+ computeHorizon: function ( eyePoint, crossEdge, face, horizon ) {
+
+ // moves face's vertices to the 'unassigned' vertex list
+
+ this.deleteFaceVertices( face );
+
+ face.mark = Deleted;
+
+ var edge;
+
+ if ( crossEdge === null ) {
+
+ edge = crossEdge = face.getEdge( 0 );
+
+ } else {
+
+ // start from the next edge since 'crossEdge' was already analyzed
+ // (actually 'crossEdge.twin' was the edge who called this method recursively)
+
+ edge = crossEdge.next;
+
+ }
+
+ do {
+
+ var twinEdge = edge.twin;
+ var oppositeFace = twinEdge.face;
+
+ if ( oppositeFace.mark === Visible ) {
+
+ if ( oppositeFace.distanceToPoint( eyePoint ) > this.tolerance ) {
+
+ // the opposite face can see the vertex, so proceed with next edge
+
+ this.computeHorizon( eyePoint, twinEdge, oppositeFace, horizon );
+
+ } else {
+
+ // the opposite face can't see the vertex, so this edge is part of the horizon
+
+ horizon.push( edge );
+
+ }
+
+ }
+
+ edge = edge.next;
+
+ } while ( edge !== crossEdge );
+
+ return this;
+
+ },
+
+ // Creates a face with the vertices 'eyeVertex.point', 'horizonEdge.tail' and 'horizonEdge.head' in CCW order
+
+ addAdjoiningFace: function ( eyeVertex, horizonEdge ) {
+
+ // all the half edges are created in ccw order thus the face is always pointing outside the hull
+
+ var face = Face.create( eyeVertex, horizonEdge.tail(), horizonEdge.head() );
+
+ this.faces.push( face );
+
+ // join face.getEdge( - 1 ) with the horizon's opposite edge face.getEdge( - 1 ) = face.getEdge( 2 )
+
+ face.getEdge( - 1 ).setTwin( horizonEdge.twin );
+
+ return face.getEdge( 0 ); // the half edge whose vertex is the eyeVertex
+
+
+ },
+
+ // Adds 'horizon.length' faces to the hull, each face will be linked with the
+ // horizon opposite face and the face on the left/right
+
+ addNewFaces: function ( eyeVertex, horizon ) {
+
+ this.newFaces = [];
+
+ var firstSideEdge = null;
+ var previousSideEdge = null;
+
+ for ( var i = 0; i < horizon.length; i ++ ) {
+
+ var horizonEdge = horizon[ i ];
+
+ // returns the right side edge
+
+ var sideEdge = this.addAdjoiningFace( eyeVertex, horizonEdge );
+
+ if ( firstSideEdge === null ) {
+
+ firstSideEdge = sideEdge;
+
+ } else {
+
+ // joins face.getEdge( 1 ) with previousFace.getEdge( 0 )
+
+ sideEdge.next.setTwin( previousSideEdge );
+
+ }
+
+ this.newFaces.push( sideEdge.face );
+ previousSideEdge = sideEdge;
+
+ }
+
+ // perform final join of new faces
+
+ firstSideEdge.next.setTwin( previousSideEdge );
+
+ return this;
+
+ },
+
+ // Adds a vertex to the hull
+
+ addVertexToHull: function ( eyeVertex ) {
+
+ var horizon = [];
+ var i, face;
+
+ this.unassigned.clear();
+
+ // remove 'eyeVertex' from 'eyeVertex.face' so that it can't be added to the 'unassigned' vertex list
+
+ this.removeVertexFromFace( eyeVertex, eyeVertex.face );
+
+ this.computeHorizon( eyeVertex.point, null, eyeVertex.face, horizon );
+
+ this.addNewFaces( eyeVertex, horizon );
+
+ // reassign 'unassigned' vertices to the new faces
+
+ this.resolveUnassignedPoints( this.newFaces );
+
+ return this;
+
+ },
+
+ cleanup: function () {
+
+ this.assigned.clear();
+ this.unassigned.clear();
+ this.newFaces = [];
+
+ return this;
+
+ },
+
+ compute: function () {
+
+ var vertex;
+
+ this.computeInitialHull();
+
+ // add all available vertices gradually to the hull
+
+ while ( ( vertex = this.nextVertexToAdd() ) !== undefined ) {
+
+ this.addVertexToHull( vertex );
+
+ }
+
+ this.reindexFaces();
+
+ this.cleanup();
+
+ return this;
+
+ }
+
+ } );
+
+ //
+
+ function Face() {
+
+ this.normal = new THREE.Vector3();
+ this.midpoint = new THREE.Vector3();
+ this.area = 0;
+
+ this.constant = 0; // signed distance from face to the origin
+ this.outside = null; // reference to a vertex in a vertex list this face can see
+ this.mark = Visible;
+ this.edge = null;
+
+ }
+
+ Object.assign( Face, {
+
+ create: function( a, b, c ) {
+
+ var face = new Face();
+
+ var e0 = new HalfEdge( a, face );
+ var e1 = new HalfEdge( b, face );
+ var e2 = new HalfEdge( c, face );
+
+ // join edges
+
+ e0.next = e2.prev = e1;
+ e1.next = e0.prev = e2;
+ e2.next = e1.prev = e0;
+
+ // main half edge reference
+
+ face.edge = e0;
+
+ return face.compute();
+
+ }
+
+ } );
+
+ Object.assign( Face.prototype, {
+
+ getEdge: function ( i ) {
+
+ var edge = this.edge;
+
+ while ( i > 0 ) {
+
+ edge = edge.next;
+ i --;
+
+ }
+
+ while ( i < 0 ) {
+
+ edge = edge.prev;
+ i ++;
+
+ }
+
+ return edge;
+
+ },
+
+ compute: function () {
+
+ var triangle;
+
+ return function compute () {
+
+ if ( triangle === undefined ) triangle = new THREE.Triangle();
+
+ var a = this.edge.tail();
+ var b = this.edge.head();
+ var c = this.edge.next.head();
+
+ triangle.set( a.point, b.point, c.point );
+
+ triangle.normal( this.normal );
+ triangle.midpoint( this.midpoint );
+ this.area = triangle.area();
+
+ this.constant = this.normal.dot( this.midpoint );
+
+ return this;
+
+ };
+
+ }(),
+
+ distanceToPoint: function ( point ) {
+
+ return this.normal.dot( point ) - this.constant;
+
+ }
+
+ } );
+
+ // Entity for a Doubly-Connected Edge List (DCEL).
+
+ function HalfEdge( vertex, face ) {
+
+ this.vertex = vertex;
+ this.prev = null;
+ this.next = null;
+ this.twin = null;
+ this.face = face;
+
+ }
+
+ Object.assign( HalfEdge.prototype, {
+
+ head: function () {
+
+ return this.vertex;
+
+ },
+
+ tail: function () {
+
+ return this.prev ? this.prev.vertex : null;
+
+ },
+
+ length: function () {
+
+ var head = this.head();
+ var tail = this.tail();
+
+ if ( tail !== null ) {
+
+ return tail.point.distanceTo( head.point );
+
+ }
+
+ return - 1;
+
+ },
+
+ lengthSquared: function () {
+
+ var head = this.head();
+ var tail = this.tail();
+
+ if ( tail !== null ) {
+
+ return tail.point.distanceToSquared( head.point );
+
+ }
+
+ return - 1;
+
+ },
+
+ setTwin: function ( edge ) {
+
+ this.twin = edge;
+ edge.twin = this;
+
+ return this;
+
+ }
+
+ } );
+
+ // A vertex as a double linked list node.
+
+ function VertexNode( point ) {
+
+ this.point = point;
+ this.prev = null;
+ this.next = null;
+ this.face = null; // the face that is able to see this vertex
+
+ }
+
+ // A double linked list that contains vertex nodes.
+
+ function VertexList() {
+
+ this.head = null;
+ this.tail = null;
+
+ }
+
+ Object.assign( VertexList.prototype, {
+
+ first: function () {
+
+ return this.head;
+
+ },
+
+ last: function () {
+
+ return this.tail;
+
+ },
+
+ clear: function () {
+
+ this.head = this.tail = null;
+
+ return this;
+
+ },
+
+ // Inserts a vertex before the target vertex
+
+ insertBefore: function ( target, vertex ) {
+
+ vertex.prev = target.prev;
+ vertex.next = target;
+
+ if ( vertex.prev === null ) {
+
+ this.head = vertex;
+
+ } else {
+
+ vertex.prev.next = vertex;
+
+ }
+
+ target.prev = vertex;
+
+ return this;
+
+ },
+
+ // Inserts a vertex after the target vertex
+
+ insertAfter: function ( target, vertex ) {
+
+ vertex.prev = target;
+ vertex.next = target.next;
+
+ if ( vertex.next === null ) {
+
+ this.tail = vertex;
+
+ } else {
+
+ vertex.next.prev = vertex;
+
+ }
+
+ target.next = vertex;
+
+ return this;
+
+ },
+
+ // Appends a vertex to the end of the linked list
+
+ append: function ( vertex ) {
+
+ if ( this.head === null ) {
+
+ this.head = vertex;
+
+ } else {
+
+ this.tail.next = vertex;
+
+ }
+
+ vertex.prev = this.tail;
+ vertex.next = null; // the tail has no subsequent vertex
+
+ this.tail = vertex;
+
+ return this;
+
+ },
+
+ // Appends a chain of vertices where 'vertex' is the head.
+
+ appendChain: function ( vertex ) {
+
+ if ( this.head === null ) {
+
+ this.head = vertex;
+
+ } else {
+
+ this.tail.next = vertex;
+
+ }
+
+ vertex.prev = this.tail;
+
+ // ensure that the 'tail' reference points to the last vertex of the chain
+
+ while ( vertex.next !== null ) {
+
+ vertex = vertex.next;
+
+ }
+
+ this.tail = vertex;
+
+ return this;
+
+ },
+
+ // Removes a vertex from the linked list
+
+ remove: function ( vertex ) {
+
+ if ( vertex.prev === null ) {
+
+ this.head = vertex.next;
+
+ } else {
+
+ vertex.prev.next = vertex.next;
+
+ }
+
+ if ( vertex.next === null ) {
+
+ this.tail = vertex.prev;
+
+ } else {
+
+ vertex.next.prev = vertex.prev;
+
+ }
+
+ return this;
+
+ },
+
+ // Removes a list of vertices whose 'head' is 'a' and whose 'tail' is b
+
+ removeSubList: function ( a, b ) {
+
+ if ( a.prev === null ) {
+
+ this.head = b.next;
+
+ } else {
+
+ a.prev.next = b.next;
+
+ }
+
+ if ( b.next === null ) {
+
+ this.tail = a.prev;
+
+ } else {
+
+ b.next.prev = a.prev;
+
+ }
+
+ return this;
+
+ },
+
+ isEmpty: function() {
+
+ return this.head === null;
+
+ }
+
+ } );
+
+ // export
+
+ THREE.QuickHull = QuickHull;
+
+
+} ) ();
diff --git a/examples/js/geometries/ConvexGeometry.js b/examples/js/geometries/ConvexGeometry.js
index cb4e9427f591b36406e16c6fc1a746c1070e60a9..f158e4922d589d06c2780b7ae52fc46f5212c6e3 100644
--- a/examples/js/geometries/ConvexGeometry.js
+++ b/examples/js/geometries/ConvexGeometry.js
@@ -1,214 +1,85 @@
/**
- * @author qiao / https://github.com/qiao
- * @fileoverview This is a convex hull generator using the incremental method.
- * The complexity is O(n^2) where n is the number of vertices.
- * O(nlogn) algorithms do exist, but they are much more complicated.
- *
- * Benchmark:
- *
- * Platform: CPU: P7350 @2.00GHz Engine: V8
- *
- * Num Vertices Time(ms)
- *
- * 10 1
- * 20 3
- * 30 19
- * 40 48
- * 50 107
+ * @author Mugen87 / https://github.com/Mugen87
*/
-THREE.ConvexGeometry = function( vertices ) {
+( function() {
- THREE.Geometry.call( this );
+ // ConvexGeometry
- var faces = [ [ 0, 1, 2 ], [ 0, 2, 1 ] ];
+ function ConvexGeometry( points ) {
- for ( var i = 3; i < vertices.length; i ++ ) {
+ THREE.Geometry.call( this );
- addPoint( i );
+ this.type = 'ConvexGeometry';
- }
-
-
- function addPoint( vertexId ) {
-
- var vertex = vertices[ vertexId ].clone();
-
- var mag = vertex.length();
- vertex.x += mag * randomOffset();
- vertex.y += mag * randomOffset();
- vertex.z += mag * randomOffset();
-
- var hole = [];
-
- for ( var f = 0; f < faces.length; ) {
-
- var face = faces[ f ];
-
- // for each face, if the vertex can see it,
- // then we try to add the face's edges into the hole.
- if ( visible( face, vertex ) ) {
-
- for ( var e = 0; e < 3; e ++ ) {
-
- var edge = [ face[ e ], face[ ( e + 1 ) % 3 ] ];
- var boundary = true;
-
- // remove duplicated edges.
- for ( var h = 0; h < hole.length; h ++ ) {
-
- if ( equalEdge( hole[ h ], edge ) ) {
-
- hole[ h ] = hole[ hole.length - 1 ];
- hole.pop();
- boundary = false;
- break;
-
- }
-
- }
-
- if ( boundary ) {
-
- hole.push( edge );
-
- }
-
- }
-
- // remove faces[ f ]
- faces[ f ] = faces[ faces.length - 1 ];
- faces.pop();
-
- } else {
-
- // not visible
-
- f ++;
-
- }
-
- }
-
- // construct the new faces formed by the edges of the hole and the vertex
- for ( var h = 0; h < hole.length; h ++ ) {
-
- faces.push( [
- hole[ h ][ 0 ],
- hole[ h ][ 1 ],
- vertexId
- ] );
-
- }
+ this.fromBufferGeometry( new ConvexBufferGeometry( points ) );
+ this.mergeVertices();
}
- /**
- * Whether the face is visible from the vertex
- */
- function visible( face, vertex ) {
-
- var va = vertices[ face[ 0 ] ];
- var vb = vertices[ face[ 1 ] ];
- var vc = vertices[ face[ 2 ] ];
-
- var n = normal( va, vb, vc );
+ ConvexGeometry.prototype = Object.create( THREE.Geometry.prototype );
+ ConvexGeometry.prototype.constructor = ConvexGeometry;
- // distance from face to origin
- var dist = n.dot( va );
+ // ConvexBufferGeometry
- return n.dot( vertex ) >= dist;
+ function ConvexBufferGeometry( points ) {
- }
-
- /**
- * Face normal
- */
- function normal( va, vb, vc ) {
+ THREE.BufferGeometry.call( this );
- var cb = new THREE.Vector3();
- var ab = new THREE.Vector3();
+ this.type = 'ConvexBufferGeometry';
- cb.subVectors( vc, vb );
- ab.subVectors( va, vb );
- cb.cross( ab );
+ // buffers
- cb.normalize();
+ var vertices = [];
+ var normals = [];
- return cb;
+ // execute QuickHull
- }
+ if ( THREE.QuickHull === undefined ) {
- /**
- * Detect whether two edges are equal.
- * Note that when constructing the convex hull, two same edges can only
- * be of the negative direction.
- */
- function equalEdge( ea, eb ) {
+ console.error( 'THREE.ConvexBufferGeometry: ConvexBufferGeometry relies on THREE.QuickHull' );
- return ea[ 0 ] === eb[ 1 ] && ea[ 1 ] === eb[ 0 ];
-
- }
-
- /**
- * Create a random offset between -1e-6 and 1e-6.
- */
- function randomOffset() {
+ }
- return ( Math.random() - 0.5 ) * 2 * 1e-6;
+ var quickHull = new THREE.QuickHull().setFromPoints( points );
- }
+ // generate vertices and normals
- // Push vertices into `this.vertices`, skipping those inside the hull
- var id = 0;
- var newId = new Array( vertices.length ); // map from old vertex id to new id
+ var faces = quickHull.faces;
- for ( var i = 0; i < faces.length; i ++ ) {
+ for ( var i = 0; i < faces.length; i ++ ) {
- var face = faces[ i ];
+ var face = faces[ i ];
+ var edge = face.edge;
- for ( var j = 0; j < 3; j ++ ) {
+ // we move along a doubly-connected edge list to access all face points (see HalfEdge docs)
- if ( newId[ face[ j ] ] === undefined ) {
+ do {
- newId[ face[ j ] ] = id ++;
- this.vertices.push( vertices[ face[ j ] ] );
+ var point = edge.head().point;
- }
+ vertices.push( point.x, point.y, point.z );
+ normals.push( face.normal.x, face.normal.y, face.normal.z );
- face[ j ] = newId[ face[ j ] ];
+ edge = edge.next;
- }
+ } while ( edge !== face.edge );
- }
+ }
- // Convert faces into instances of THREE.Face3
- for ( var i = 0; i < faces.length; i ++ ) {
+ // build geometry
- this.faces.push( new THREE.Face3(
- faces[ i ][ 0 ],
- faces[ i ][ 1 ],
- faces[ i ][ 2 ]
- ) );
+ this.addAttribute( 'position', new THREE.Float32BufferAttribute( vertices, 3 ) );
+ this.addAttribute( 'normal', new THREE.Float32BufferAttribute( normals, 3 ) );
}
- this.computeFaceNormals();
-
- // Compute flat vertex normals
- for ( var i = 0; i < this.faces.length; i ++ ) {
-
- var face = this.faces[ i ];
- var normal = face.normal;
-
- face.vertexNormals[ 0 ] = normal.clone();
- face.vertexNormals[ 1 ] = normal.clone();
- face.vertexNormals[ 2 ] = normal.clone();
-
- }
+ ConvexBufferGeometry.prototype = Object.create( THREE.BufferGeometry.prototype );
+ ConvexBufferGeometry.prototype.constructor = ConvexBufferGeometry;
-};
+ // export
-THREE.ConvexGeometry.prototype = Object.create( THREE.Geometry.prototype );
-THREE.ConvexGeometry.prototype.constructor = THREE.ConvexGeometry;
+ THREE.ConvexGeometry = ConvexGeometry;
+ THREE.ConvexBufferGeometry = ConvexBufferGeometry;
+} ) ();
diff --git a/examples/webgl_geometry_convex.html b/examples/webgl_geometry_convex.html
index 7fe2ea2126dc302c5771b3172ed4a1caa0d7e9cc..9d6caa8ef0fc75853dcf7d3fd3cdae9f88c4ab7f 100644
--- a/examples/webgl_geometry_convex.html
+++ b/examples/webgl_geometry_convex.html
@@ -30,6 +30,7 @@
+
@@ -53,11 +54,13 @@
document.body.appendChild( renderer.domElement );
// camera
+
camera = new THREE.PerspectiveCamera( 40, window.innerWidth / window.innerHeight, 1, 1000 );
camera.position.set( 15, 20, 30 );
scene.add( camera );
// controls
+
controls = new THREE.OrbitControls( camera, renderer.domElement );
controls.minDistance = 20;
controls.maxDistance = 50;
@@ -65,12 +68,16 @@
scene.add( new THREE.AmbientLight( 0x222222 ) );
+ // light
+
var light = new THREE.PointLight( 0xffffff, 1 );
camera.add( light );
+ // helper
+
scene.add( new THREE.AxisHelper( 20 ) );
- //
+ // textures
var loader = new THREE.TextureLoader();
var texture = loader.load( 'textures/sprites/disc.png' );
@@ -108,7 +115,7 @@
transparent: true
} );
- var meshGeometry = new THREE.ConvexGeometry( pointsGeometry.vertices );
+ var meshGeometry = new THREE.ConvexBufferGeometry( pointsGeometry.vertices );
mesh = new THREE.Mesh( meshGeometry, meshMaterial );
mesh.material.side = THREE.BackSide; // back faces