Conservative voxelization

Authors:
Long Zhang;Wei Chen;David S. Ebert;Qunsheng Peng
Affiliations:
Zhejiang University, State Key Lab of CAD&CG, 310027, Hangzhou, China;Zhejiang University, State Key Lab of CAD&CG, 310027, Hangzhou, China;Purdue University, The School of Electrical and Computer Engineering, 465 Northwestern Ave., 47907, West Lafayette, IN, USA;Zhejiang University, State Key Lab of CAD&CG, 310027, Hangzhou, China
Venue:
The Visual Computer: International Journal of Computer Graphics
Year:
2007

Citing 0
Cited 13

Interactive relighting of dynamic refractive objects

ACM SIGGRAPH 2008 papers
Single-pass GPU solid voxelization for real-time applications

GI '08 Proceedings of graphics interface 2008
Fast parallel surface and solid voxelization on GPUs

ACM SIGGRAPH Asia 2010 papers
Voxel-based global illumination

I3D '11 Symposium on Interactive 3D Graphics and Games
Novel geometrical voxelization approach with application to streamlines

Journal of Computer Science and Technology
VoxelPipe: a programmable pipeline for 3D voxelization

Proceedings of the ACM SIGGRAPH Symposium on High Performance Graphics
Point-tessellated voxelization

Proceedings of Graphics Interface 2012
Real-Time Fluid Effects on Surfaces using the Closest Point Method

Computer Graphics Forum
Out-of-core construction of sparse voxel octrees

Proceedings of the 5th High-Performance Graphics Conference
A sweep and translate algorithm for computing voxelized 3D Minkowski sums on the GPU

Computer-Aided Design
Edge concealment in a combined surface mesh and scalar-field tissue model for surgical simulations

Simulation
Geometry-shader-based real-time voxelization and applications

The Visual Computer: International Journal of Computer Graphics
A topological approach to voxelization

EGSR '13 Proceedings of the Eurographics Symposium on Rendering

Quantified Score

Hi-index	0.01

Visualization

Abstract

We propose a novel hardware-accelerated voxelization algorithm for polygonal models. Compared with previous approaches, our algorithm has a major advantage that it guarantees the conservative correctness in voxelization: every voxel intersecting the input model is correctly recognized. This property is crucial for applications like collision detection, occlusion culling and visibility processing. We also present an efficient and robust implementation of the algorithm in the GPU. Experiments show that our algorithm has a lower memory consumption than previous approaches and is more efficient when the volume resolution is high. In addition, our algorithm requires no preprocessing and is suitable for voxelizing deformable models.