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

Authors:
Jianguang Weng;Yueting Zhuang;Hui Zhang
Affiliations:
College of Computer Science and Technology, Zhejiang University, Hangzhou, China;College of Computer Science and Technology, Zhejiang University, Hangzhou, China;Department of Computer Science, Indiana University, Bloomington
Venue:
ISVC'05 Proceedings of the First international conference on Advances in Visual Computing
Year:
2005

Citing 9
Cited 0

Fundamentals of surface voxelization

Graphical Models and Image Processing
An accurate method for voxelizing polygon meshes

VVS '98 Proceedings of the 1998 IEEE symposium on Volume visualization
3D scan-conversion algorithms for voxel-based graphics

I3D '86 Proceedings of the 1986 workshop on Interactive 3D graphics
A complete distance field representation

Proceedings of the conference on Visualization '01
3D Line Voxelization and Connectivity Control

IEEE Computer Graphics and Applications
Volume Graphics

Computer
A fast depth-buffer-based voxelization algorithm

Journal of Graphics Tools
Efficient Hardware Voxelization

CGI '04 Proceedings of the Computer Graphics International
Real-time Voxelization for Complex Polygonal Models

PG '04 Proceedings of the Computer Graphics and Applications, 12th Pacific Conference

Quantified Score

Hi-index	0.00

Visualization

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.