Incremental Triangle Voxelization

We present a method to incrementally voxelize triangles into a volumetric dataset with pre-filtering, generating an accurate multivalued voxelization. Multivalued voxelization allows direct volume rendering of voxelized geometry as well as volumes with intermixed geometry, accurate multiresolution representations, and efficient antialiasing. Prior voxelization methods either computed only a binary voxelization or inefficiently computed a multivalued voxelization. Our method develops incremental equations to quickly decide which filter function to compute for each voxel value. The method requires eight additions per voxel of the triangle bounding box. Being simple and efficient, the method is suitable for implementation in a hardware volume rendering system. Key words: Voxelization, volume filtering, hardware, incremental algorithm, cut planes

• Type: Conference
• Year: 2000
• Where: GRAPHICSINTERFACE
• Authors: Frank Dachille, Arie E. Kaufman
• Keywords: Accurate Multivalued Voxelization, Binary Voxelization, GRAPHICSINTERFACE 2000, GRAPHICSINTERFACE 2007, Multivalued Voxelization