Connectivity-Based Segmentation for GPU-Accelerated Mesh Decompression
College of Computer Science and Technology, Zhejiang University, Hangzhou 310027, China
Journal of Computer Science and Technology, Vol. 27 Issue (6) :1110-1118, 2012
@article{zhao2012connectivity,
title={Connectivity-Based Segmentation for GPU-Accelerated Mesh Decompression},
author={Zhao, J.Y. and Tang, M. and Tong, R.F.},
year={2012}
}
We present a novel algorithm to partition large 3D meshes for GPU-accelerated decompression. Our formulation focuses on minimizing the replicated vertices between patches, and balancing the numbers of faces of patches for efficient parallel computing. First we generate a topology model of the original mesh and remove vertex positions. Then we assign the centers of patches using geodesic farthest point sampling and cluster the faces according to the geodesic distance to the centers. After the segmentation we swap boundary faces to fix jagged boundaries and store the boundary vertices for whole-mesh preservation. The decompression of each patch runs on a thread of GPU, and we evaluate its performance on various large benchmarks. In practice, the GPU-based decompression algorithm runs more than 48x faster on NVIDIA GeForce GTX 580 GPU compared with that on the CPU using single core.
November 7, 2012 by hgpu
