Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ahn J K, Lee D Y, Ahn M, Kim C S. R-D optimized progressive compression of 3D meshes using prioritized gate selection and curvature prediction. The Visual Computer, 2011, 27(6/8): 769-779.
Lee H, Lavou G, Dupont F. Rate-distortion optimization for progressive compression of 3D mesh with color attributes. The Visual Computer, 2012, 28(2): 137-153.
Turan G. On the succinct representation of graphs. Discrete Applied Mathematics, 1984, 8(3): 289-294.
Keeler K, Westbrook J. Shortencodings of planar graphs and maps. Discrete Applied Mathematics, 1995, 58(3): 239-252.
Taubin G, Rossignac J. Geometric compression through topological surgery. ACM Transactions on Graphics, 1998, 17(2): 84-115.
Rossignac J. Edgebreaker: Connectivity compression for triangle meshes. IEEE Transactions on Visualization and Computer Graphics, 1999, 5(1): 47-61.
Gumhold S, Straßer W. Real time compression of triangle mesh connectivity. In Proc. the 25th SIGGRAPH, Jul. 1998, pp.133-140.
Gurung T, Luffel M, Lindstrom P, Rossignac J. LR: Compact connectivity representation for triangle meshes. ACM Transactions on Graphics, 2011, 30(4), Article No.67.
Yamauchi H, Lee S, Lee Y, Ohtake Y, Belyaev A, Seidel H P. Feature sensitive mesh segmentation with mean shift. In Proc. SMI, Jun. 2005, pp.238-245.
Agathos A, Pratikakis I, Perantonis S, Sapidis N. Protrusion-oriented 3D mesh segmentation. The Visual Computer, 2010, 26(1): 63-81.
Lai Y K, Hu S M, Martin R R, Rosin P L. Rapid and effective segmentation of 3D models using random walks. Computer Aided Geometric Design, 2009, 26(6): 665-679.
Lai Y K, Zhou Q Y, Hu S M, Martin R R. Feature sensitive mesh segmentation. In Proc. SPM, Jun. 2006, pp.17-25.
Zhang J Y, Zheng J M, Wu C L, Cai J F. Variational mesh decomposition. ACM Transactions on Graphics, 2012, 31(3), Article No.21.
Liu F, Hua W, Bao H J. GPU-based dynamic quad stream for forest rendering. Science China Information Sciences, 2010, 53(8): 1539-1545.
Xu K, Ma L Q, Ren B, Wang R, Hu S M. Interactive hair rendering and appearance editing under environment lighting. ACM Transactions on Graphics, 2011, 30(6), Article No.173.
Xu K, Jia Y T, Fu H, Hu S M, Tai C L. Spherical piece-wise constant basis functions for all-frequency precomputed radiance transfer. IEEE Transactions on Visualization and Computer Graphics, 2008, 14(2): 454-467.
Yoon S E, Lindstrom P. Random-accessible compressed triangle meshes. IEEE Transactions on Visualization and Computer Graphics, 2007, 13(6): 1536-1543.
Xin S Q, Wang G J. Improving Chen and Han's algorithm on the discrete geodesic problem. ACM Transactions on Graphics, 2009, 28(4), Article No.104.
Zhao J Y, Tang M, Tong R F. Mesh segmentation for parallel decompression on GPU. In Proc. CVM, Nov. 2012.
Peyré G, Cohen L D. Geodesic remeshing using front propagation. International Journal of Computer Vision, 2006, 69(1): 145-156.
Sethian J A. Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision, and Materials Science. Cambridge, England: Cambridge University Press, 2000.
Frey B J, Dueck D. Clustering by passing messages between data points. Science, 2007, 315(5814): 972-976.
Harris M, Sengupta S, Owens J D. Scan primitives for GPU computing. In Proc. HWWS, Aug. 2007.
Rossignac J. 3D compression made simple: Edgebreaker with zip&wrap on a corner-table. In Proc. SMI, May 2001, pp.278-283.
Author information
Authors and Affiliations
Corresponding author
Additional information
The work is supported in part by the National Basic Research 973 Program of China under Grant No. 2011CB302205, the National High Technology Research and Development 863 Program of China under Grant No. 2012BAD35B01, the National Natural Science Foundation of China under Grant No. 61170140, and the National Natural Science Foundation of Zhejiang Province of China under Grant No. Y1100069.
**The preliminary version of the paper was published in the Proceedings of the 2012 Computational Visual Media Conference.
Rights and permissions
About this article
Cite this article
Zhao, JY., Tang, M. & Tong, RF. Connectivity-Based Segmentation for GPU-Accelerated Mesh Decompression. J. Comput. Sci. Technol. 27, 1110–1118 (2012). https://doi.org/10.1007/s11390-012-1289-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11390-012-1289-x