Voxelization in common sampling lattices

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. 1

Accurate incremental voxelization in common sampling lattices

Work on binary surface voxelization has previously focused on Cartesian lattices. In this theses I present a generalized voxelization algorithm to any lattice structure in 2D space. In 3D I extend the algorithm to include BCC lattices. Further, I prove the correctness of our algorithm. An efficient implementation of the proposed algorithm has been achieved. Thorough testing of our algorithm gives an experimental validation to our implementation. Our results show that the efficient implementation of the proposed algorithm is (on average) 11% faster than a standard implementation