Logo der Universität Wien

Voxelization in Common Sampling Lattices

Abstract

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.

Grafik Top
Authors
Grafik Top
Supplemental Material
Citation
Category
Paper in Conference Proceedings or in Workshop Proceedings (Full Paper in Proceedings)
Event Title
Pacific Graphics 2003 (PG03)
Divisions
Visualization and Data Analysis
Subjects
Computergraphik
Event Location
Canmore, Alberta, Canada
Event Type
Conference
Event Dates
October 8 to 10
Date
October 2003
Export
Grafik Top
Contact us
Faculty of Computer Science
University of Vienna

Währinger Straße 29
A-1090 Vienna