Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

PG
2003
IEEE

favoriteEmaildiscussreport

94views Computer Graphics» more PG 2003»

Voxelization in Common Sampling Lattices

13 years 10 months ago

Voxelization in Common Sampling Lattices

Download www.cs.sfu.ca

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.

Haris Widjaya, Torsten Möller, Alireza Enteza

Real-time Traffic

Cartesian Lattices | Common Sampling Lattices | General 2D Lattices | PG 2003 |

claim paper

Related Content

» MR Image Reconstruction from PseudoHex Lattice Sampling Patterns Using Separable FFT

» FIR Filter Banks for Hexagonal Data Processing

» The Sample Tree A Sequential Hypothesis Testing Approach to 3D Object Recognition

» Geometric Texture Synthesis by Example

» A simple condition implying rapid mixing of singlesite dynamics on spin systems

» Downsampling graphs using spectral theory

» MultiClass Sparse Bayesian Regression for Neuroimaging Data Analysis

» Optimizing the topological and combinatorial complexity of isosurfaces

Post Info
More Details (n/a)

Added	05 Jul 2010
Updated	05 Jul 2010
Type	Conference
Year	2003
Where	PG
Authors	Haris Widjaya, Torsten Möller, Alireza Entezari

Comments (0)