Complete Polygonal Scene Voxelization
- 1 January 2002
- journal article
- research article
- Published by Taylor & Francis in Journal of Graphics Tools
- Vol. 7 (3) , 27-41
- https://doi.org/10.1080/10867651.2002.10487563
Abstract
We present a fast and robust tool for automatically converting complete polygonal scenes into volumetric representations. A wide range of scenes are handled by storing the status (inside/outside) of the volumetric space areas in the cells of an octree. The algorithm first looks for a point in the scene for which the status can be univocally determined. When such a point is found, it propagates its status to the surrounding visible cells. This iterative two-step procedure is repeated for different parts of the scene until the status of all the cells has been determined. The algorithm's advantage is the coherence with the rendered geometry; it can handle complex geometry and exhibits robust solutions for a broad range of scenes contai ning numerous artifacts, such as cracks, holes, overlapping geometries, interpenetrating meshes, double walls, and fuzzy borders.Keywords
This publication has 6 references indexed in Scilit:
- Voxel based object simplificationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fast 3D Triangle-Box Overlap TestingJournal of Graphics Tools, 2001
- Conservative volumetric visibility with occluder fusionPublished by Association for Computing Machinery (ACM) ,2000
- Optimized View Frustum Culling Algorithms for Bounding BoxesJournal of Graphics Tools, 2000
- A Fast Depth-Buffer-Based Voxelization AlgorithmJournal of Graphics Tools, 1999
- The Production of Volume Data from Triangular Meshes Using VoxelisationComputer Graphics Forum, 1996