Using in-leaf multiple triangle packing for kd-trees size reduction

A binary layout representative of a kd-tree of a bounding region, the bounding region comprising a number of sub-regions, the binary layout comprising:

• a plurality of node bytes to store nodes of the kd-tree, one node byte for each kd-tree node, the plurality of node bytes further comprising:
• a first node, wherein the first node is stored in the binary layout using a first memory allocation;
• a second node comprising no triangles or five or more triangles, wherein the second node is stored in the binary layout using a second memory allocation;
• and
• a third node comprising four or fewer triangles, wherein the third node is stored in the binary layout using a third memory allocation, the third memory allocation storing a triangle information for each triangle in the third node.