Writes the triangles in tree order (order[i] is the original triangle at position i), 48 bytes each. Corners are stored as they are, so a vertex shared by two triangles has identical bits in both (the watertight test needs that).
order[i]
i
Writes the triangles in tree order (
order[i]is the original triangle at positioni), 48 bytes each. Corners are stored as they are, so a vertex shared by two triangles has identical bits in both (the watertight test needs that).