Error-bounded solid voxelization for polygonal model based on heuristic seed filling

Abstract

Although surface voxelization is now becoming a matured field, solid voxelization still lags quite behind due to the lack of robust and efficient means of processing complex polygonal models. Our paper presents a fast and easy to implement error-bounded solid voxelization algorithm in three subtasks: (i) PVM (Primary Volume Model), in which most of the non-object voxels are eliminated. (ii) BVM (Boundary Volume Model), which provides reliable discrete object boundary. (iii) RVM (Revised Volume Model), which is the result of Heuristic Seed Filling as the critical portion of our algorithm. In the third subtask, the non-object voxels from PVM and the object voxels from BVM form the boundaries and seeds are computed from PVM and BVM as well. Unlike traditional seed filling, our approach achieves significantly improved performance and produces error-bounded experimental results. Furthermore, our method is more robust compared to 3D scan-filling. © Springer-Verlag Berlin Heidelberg 2005.