Abstract: System, computer-readable medium and method are provided for organizing and rendering 3D voxel models in a tree data structure. The system includes a display, a memory loaded with 3D voxel data arranged in a N3-tree data structure, and a processor that renders the 3D voxel data on the display. The N3-tree data structure includes a top node, one or more levels of middle nodes, and leaf nodes. Each of the top node and middle nodes includes 64 occupancy bits and 32 index bits. The 64 occupancy bits indicate an occupied (“1”) or empty (“0”) state of each of 64 subunits (subcubes or voxels) included in the node. The 32 index bits represent a pointer to a memory location where its occupied subunits are stored. Each of the leaf nodes represents an occupied voxel, and includes an index number that can be used to point to a memory location of at least one type of attribute value (color, normal, intensity, etc.) of the occupied voxel.

Abstract: System, computer-readable medium and method are provided for differencing (diffing) first and second sets of 3D voxel data to identify differences that may exist between the two sets. The system includes a 64-bit processor, a memory, and a display. The memory is loaded with the two sets of 3D voxel data arranged in a 64-tree data structure, wherein an occupied or empty state of each voxel is indicated by 1 bit. The processor executes a 3D voxel diffing algorithm including steps of: (i) aligning the first and second sets of 3D voxel data; (ii) making a one-to-one comparison between each voxel in the first set and a corresponding voxel in the second set to create a diff model that records differences found between the first and second sets; and (iii) displaying the content of the diff model on the display.