Voxelization in Common Sampling Lattices

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Haris Widjaya Articles by Torsten Möller Articles by Alireza Entezari

11th Pacific Conference on Computer Graphics and Applications (PG'03)

Canmore, Canada

October 08-October 10

ISBN: 0-7695-2028-6

	ASCII Text	x
	Haris Widjaya, Torsten Möller, Alireza Entezari, "Voxelization in Common Sampling Lattices," Computer Graphics and Applications, Pacific Conference on, pp. 497, 11th Pacific Conference on Computer Graphics and Applications (PG'03), 2003.

	BibTex	x
	@article{ 10.1109/PCCGA.2003.1238302, author = {Haris Widjaya and Torsten Möller and Alireza Entezari}, title = {Voxelization in Common Sampling Lattices}, journal ={Computer Graphics and Applications, Pacific Conference on}, volume = {0}, year = {2003}, isbn = {0-7695-2028-6}, pages = {497}, doi = {http://doi.ieeecomputersociety.org/10.1109/PCCGA.2003.1238302}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Computer Graphics and Applications, Pacific Conference on TI - Voxelization in Common Sampling Lattices SN - 0-7695-2028-6 SP EP A1 - Haris Widjaya, A1 - Torsten Möller, A1 - Alireza Entezari, PY - 2003 KW - null VL - 0 JA - Computer Graphics and Applications, Pacific Conference on ER -

Haris Widjaya, Simon Fraser University

Torsten Möller, Simon Fraser University

Alireza Entezari, Simon Fraser University

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PCCGA.2003.1238302

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.

Citation:

Haris Widjaya, Torsten Möller, Alireza Entezari, "Voxelization in Common Sampling Lattices," pg, pp.497, 11th Pacific Conference on Computer Graphics and Applications (PG'03), 2003

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.