Using distance maps for accurate surface representation in sampled volumes
VVS '98 Proceedings of the 1998 IEEE symposium on Volume visualization
An accurate method for voxelizing polygon meshes
VVS '98 Proceedings of the 1998 IEEE symposium on Volume visualization
A practical evaluation of popular volume rendering algorithms
VVS '00 Proceedings of the 2000 IEEE symposium on Volume visualization
Space-time points: 4d splatting on efficient grids
VVS '02 Proceedings of the 2002 IEEE symposium on Volume visualization and graphics
Alias-Free Voxelization of Geometric Objects
IEEE Transactions on Visualization and Computer Graphics
Isosurfaces on optimal regular samples
VISSYM '03 Proceedings of the symposium on Data visualisation 2003
Volume sampled voxelization of geometric primitives
VIS '93 Proceedings of the 4th conference on Visualization '93
A flexible 3D slicer for voxelization using graphics hardware
GRAPHITE '05 Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia
Novel geometrical voxelization approach with application to streamlines
Journal of Computer Science and Technology
A topological approach to voxelization
EGSR '13 Proceedings of the Eurographics Symposium on Rendering
| Hi-index | 0.00 |
In this paper we introduce algorithms to voxelize polygonal meshes in common sampling lattices. In the case of Cartesian lattices, we complete the separability and minimality proof for the voxelization method presented by Huang et al [5]. We extend the ideas to general 2D lattices, including hexagonal lattices, and 3D body-centred cubic lattices. The notion of connectedness in the two lattice structures is discussed along with a novel voxelization algorithm for such lattices. Finally we present the proof that meshes voxelized with our proposed algorithm satisfy the separability and minimality criteria.