The BVHBuildNode constructor only initializes the children pointers; we’ll distinguish between leaf and interior nodes by whether their children point

< points' data if leaf Create empty leaf

! * Returns: * - intersected triangle index * - index of point on the left of the line * - index of point on the right of the l

Performing a Boolean "union" operation with the same object, while allowing general position enforcement (with MC_DISPATCH_ENFORCE_GENERAL_POSITION).

An intersection between two triangles where one intersection point would be the result of two edges intersecting, which is not allowed (if perturbatio

Performing a Boolean "union" operation with the same object, while forgetting to pass the appropriate MC_DISPATCH_ENFORCE_GENERAL_POSITION flag.

Add a new node and return it's index in nodes buffer

This is the "main" function of each device/API/manger thread. When a context is created and the internal scheduling threadpool is initialised, each (d

Calculate split location, direction, and children boxes

dfs(node u) for each node v connected to u : if v is not visited : visited[v] = true dfs(v) */

Get edge first vertex

Get edge second vertex

Get edge second vertex

! * Converts piece->original_edges mapping to original_edge->pieces * @param pieceToOriginals maps pieces to original edges * @return mapping of or