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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kaufman, A., Cohen, D., Yagel, R.: Volume Graphics. IEEE Computer 26(7), 51–64 (1993)
Kaufman, A., Shimony, E.: 3D Scan-conversion Algorithms for Voxel-based Graphics. In: Proc. of ACM Workshop on Interactive 3D Graphics 1986, pp. 45–76 (1986)
Cohen, D., Kaufman, A.: Fundamental of Surface Voxelization. Graphical Models and Image Processing 57(6), 453–461 (1995)
Cohen, D., Kaufman, A.: 3D Line Voxelization and Connectivity Control. IEEE Computer Graphics and Applications 17(6), 80–87 (1997)
Kaufman, A.: Efficient Algorithms for Scan-converting 3D Polygons. Computers and Graphics 12(2), 213–219 (1988)
Amanatides, J., Woo, A.: A Fast Voxel Traversal Algorithm for Ray Tracing. In: Eurographics, 1987, pp. 3–9 (1987)
Andres, E., Nehlig, P., Françon, J.: Tunnel-free Supercover 3D Polygons and Polyhedra. Computer Graphics Forum 16(3), 3–13 (1997)
Huang, J., Yagel, R., Filippov, V., Kurzion, Y.: An Accurate Method for Voxelizing Polygon Meshes. In: Proc. of the 1998 IEEE Symposium on Volume Visualization, Research Triangle Park, North Carolina, USA, pp. 119–126 (1998)
Fang, S.F., Chen, H.S.: Hardware Accelerated Voxelization. Computers and Graphics 24(3), 433–442 (2000)
Dong, Z., Chen, W., Bao, H.J., Zhang, H.X., Peng, Q.S.: Real-time Voxelization for Complex Polygonal Models. In: Pacific Conference on Computer Graphics and Applications, Seoul, Korean, pp. 43–50 (2004)
Huang, J., Li, Y., Crawfis, R., Lu, S.C., Liou, S.Y.: A Complete Distance Field Representation. In: Proc. of the Conference on Visualization, San Diego, California, USA, pp. 247–254 (2001)
Karabassi, E.A., Papaioannou, G., Theoharis, T.: A Fast Depth-buffer-based Voxelization Algorithm. Journal of Graphics Tools 14(4), 5–10 (1999)
Passalis, G., Kakadiaris, I.A., Theoharis, T.: Efficient Hardware Voxelization. In: Proc. of the Computer Graphics International, pp. 374–377 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weng, J., Zhuang, Y., Zhang, H. (2005). Error-Bounded Solid Voxelization for Polygonal Model Based on Heuristic Seed Filling. In: Bebis, G., Boyle, R., Koracin, D., Parvin, B. (eds) Advances in Visual Computing. ISVC 2005. Lecture Notes in Computer Science, vol 3804. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11595755_74
Download citation
DOI: https://doi.org/10.1007/11595755_74
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30750-1
Online ISBN: 978-3-540-32284-9
eBook Packages: Computer ScienceComputer Science (R0)