https://answers.unity.com/questions/1522620/converting-a-3d-polygon-into-a-2d-polygon.html

Children setter for convenience

three stages to BVH construction

compute index (0...N-1) of the leaf level from the number of leaves

Given triangle and a vertex find opposed triangle

compute right-most leaf node in tree

Remap removing super-triangle: subtract 3 from vertices

basic comparison of doubles

basic comparison of doubles

Compute the signed solid angle subtended by triangle abc from query point.

Expands a 10-bit integer into 30 bits by inserting 2 zeros after each bit.

returns (user controllable) epsilon representing the maximum by which the cut-mesh can be perturbed on any axis

compute tree-level index from implicit index of a node

https://stackoverflow.com/questions/47981/how-do-you-set-clear-and-toggle-a-single-bit

find the number of trailing zeros in v http://graphics.stanford.edu/~seander/bithacks.html#ZerosOnRightLinear

Add point to KD-tree

given a normal vector (not necessarily normalized) and its largest component, calculate a matrix P that will project any 3D vertex to 2D by removing t

If either mesh is not watertight, then we return [no intersection]! NOTE: even if the meshes appear closed (in the geometric sense) as long as either

Check if location is classified as on any of three edges

Test if two vertices share at least one common triangle

this function converts an index array mesh (e.g. as recieved by the dispatch function) into a halfedge mesh representation for the kernel backend.

basic comparison of doubles

Intersect a line segment with a plane Return values: 'p': The segment lies wholly within the plane. 'q': The(first) q endpoint is on the plane (but n

Neighbor index from a on-edge location \note Call only if located on the edge!

returns (user controllable) maximum number of times by which the cut-mesh can be perturbed before giving (input likely need to be preprocessed)

Given two triangles, return vertex of first triangle opposed to the second

compute size of of Oi-BVH give number of triangles

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

@brief: Given a list of sorted vertices which belong to a histogram bin, check that a particular component (x, y, or z) of their coordinates is no

compute log-base-2 of "x"

Initialize KD-tree with points

Check if node is a leaf (has no valid children)

TODO: thsi can be improved by comparing based on the largest component of the difference vector sort points along a straight line

logs time and sets m_command_exec_status to MC_COMPLETE

a seam vertex is simply an intersection point, including a duplicated instance if it exists as determined by the parameters "ps_num_vertices" and "m1_

Calculates a 30-bit Morton code for the given 3D point located within the unit cube [0,1].

next power of two from x

update the status of the event object to "finished"

Index of triangle's neighbor opposed to a vertex