The basis for a half-edge data structure, also known as doubly connected edge list (DCEL).
[page:VertexNode vertex] - [page:VertexNode] A reference to its destination vertex.
[page:Face face] - [page:Face] A reference to its face.
Creates a new instance of [name].
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.
Reference to the previous half-edge of the same face. Default is null.
Reference to the next half-edge of the same face. Default is null.
Reference to the twin half-edge to reach the opposite face. Default is null.
Each half-edge bounds a single face and thus has a reference to that face. Default is undefined.
Returns the destination vertex.
Returns the origin vertex.
Returns the [link:https://en.wikipedia.org/wiki/Euclidean_distance Euclidean length] (straight-line length) of the edge.
Returns the square of the [link:https://en.wikipedia.org/wiki/Euclidean_distance Euclidean length] (straight-line length) of the 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.
[link:https://github.com/mrdoob/three.js/blob/master/examples/jsm/math/ConvexHull.js examples/jsm/math/ConvexHull.js]