Improved internal voxelization algorithm based on depth buffer

Aiming to address the inefficiencies in existing internal voxelization algorithms, a solution has been proposed to use a two-dimensional depth buffer table to record the interval range of surface voxels, reducing the number of internal voxels to be checked. The complexity of this algorithm is independent of the model’s complexity. the voxel model is stored using a non-uniformly subdivided octree structure, where if a particular layer’s node and all of its child nodes are internal voxels, there is no need for further subdivision, reducing storage space. Experimental results indicate that the improved algorithm can run correctly while achieving better time and space efficiency.