also disassociates (not remove) any face(s) incident to edge via its halfedges, and also disassociates the halfedges

also disassociates (not remove) any halfedges(s) and vertices incident to face

point an intersection halfedge to the correct instance of an intersection point

The InitInterior() method requires that the two children nodes already have been cre- ated, so that their pointers can be passed in. This requirement

count leading zeros in 32 bit bitfield

https://stackoverflow.com/questions/355967/how-to-use-msvc-intrinsics-to-get-the-equivalent-of-this-gcc-code

Compute the intersection point between a line (not a segment) and a plane defined by a polygon. Parameters: 'p' : output intersection point (computed

entry point

Envelop box around a point

Compute barycentric coordinates (u, v, w) for point p with respect to triangle (a, b, c)

Compute barycentric coordinates (u, v, w) for point p with respect to triangle (a, b, c)

Compute barycentric coordinates (u, v, w) for point p with respect to triangle (a, b, c)

Compute barycentric coordinates (u, v, w) for point p with respect to triangle (a, b, c)

If triangle has a given neighbor return neighbor-index, throw otherwise

* Calculate triangles adjacent to vertices (triangles by vertex index) * @param triangles triangulation * @param verticesSize total number of vertic

Find nearest point using R-tree

Query kd-tree for a nearest neighbor point @note external point-buffer is used to reduce kd-tree's memory footprint @param point query point position

Opposed vertex index from neighbor index

thread-safe function to set the callback function for an event object

* execution_status specifies the new execution status to be set and can be CL_​COMPLETE or a negative integer value to indicate an error. * A negativ

update the m0 edges incident on two given intersecting faces of the polygon soup mesh "incident" just means that the edge will be used to clip the fac