5264

Fast parallel surface and solid voxelization on GPUs

Michael Schwarz, Hans-Peter Seidel
Max-Planck-Institut Informatik
ACM Transactions on Graphics (TOG) – Proceedings of ACM SIGGRAPH Asia 2010, Volume 29 Issue 6, December 2010

@article{schwarz2010fast,

   title={Fast parallel surface and solid voxelization on gpus},

   author={Schwarz, M. and Seidel, H.P.},

   journal={ACM Transactions on Graphics (TOG)},

   volume={29},

   number={6},

   pages={179},

   year={2010},

   publisher={ACM}

}

Download Download (PDF)   View View   Source Source   

1068

views

This paper presents data-parallel algorithms for surface and solid voxelization on graphics hardware. First, a novel conservative surface voxelization technique, setting all voxels overlapped by a mesh’s triangles, is introduced, which is up to one order of magnitude faster than previous solutions leveraging the standard rasterization pipeline. We then show how the involved new triangle/box overlap test can be adapted to yield a 6-separating surface voxelization, which is thinner but still connected and gap-free. Complementing these algorithms, both a triangle-parallel and a tile-based technique for solid voxelization are subsequently presented. Finally, addressing the high memory consumption of high-resolution voxel grids, we introduce a novel octree-based sparse solid voxelization approach, where only close to the solid’s boundary finest-level voxels are stored, whereas uniform interior and exterior regions are represented by coarser-level voxels. This representation is created directly from a mesh without requiring a full intermediate solid voxelization, enabling GPU-based voxelizations of unprecedented size.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: