The shape of a binary tree over a mesh's triangles.
order[i] is the original triangle stored at position i: a permutation
of 0 .. triangleCount - 1.
children holds four words per node, node 0 being the root:
leftIndex, leftCount, rightIndex, rightCount. A child with count > 0 is
a leaf of the triangles at positions [index, index + count) of order;
count == 0 means the inner node index. Only a one-triangle mesh may
have an empty right child (index = TOPOLOGY_EMPTY_CHILD).
The shape of a binary tree over a mesh's triangles.
order[i]is the original triangle stored at positioni: a permutation of0 .. triangleCount - 1.childrenholds four words per node, node 0 being the root:leftIndex, leftCount, rightIndex, rightCount. A child withcount > 0is a leaf of the triangles at positions[index, index + count)oforder;count == 0means the inner nodeindex. Only a one-triangle mesh may have an empty right child (index= TOPOLOGY_EMPTY_CHILD).