The basis for a half-edge data structure, also known as doubly connected edge list (DCEL).
vertex - VertexNode A reference to its destination vertex.
face - Face A reference to its face.
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 destintation vertex.
Returns the origin vertex.
Returns the Euclidean length (straight-line length) of the edge.
Returns the square of the Euclidean length (straight-line length) of the edge.
Sets the twin edge of this half-edge. It also ensures that the twin reference of the given half-edge is correctly set.
For more info on how to obtain the source code of this module see this page.