期刊文献+

Connectivity-Based Segmentation for GPU-Accelerated Mesh Decompression 被引量:7

Connectivity-Based Segmentation for GPU-Accelerated Mesh Decompression
原文传递
导出
摘要 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 emcient 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. 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 emcient 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.
出处 《Journal of Computer Science & Technology》 SCIE EI CSCD 2012年第6期1110-1118,共9页 计算机科学技术学报(英文版)
基金 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 the National Natural Science Foundation of Zhejiang Province of China under Grant No.Y1100069
关键词 parallel decompression mesh segmentation connectivity compression GPU Edgebreaker parallel decompression, mesh segmentation, connectivity compression, GPU, Edgebreaker
  • 相关文献

参考文献1

二级参考文献14

  • 1Erikson C, Manocha D. GAPS: general and automatic polygonal simplification. In: Proceedings of ACM Symposium on Interactive 3D Graphics, Atlanta, Georgia, USA, 1999. 79- 88.
  • 2Garland M, Heckbert P S. Surface simplification using quadric error metrics. In: Proceedings of ACM SIGGRAPH, Los Angeles, California, USA, 1997. 209 -216.
  • 3Hoppe H. Progressive meshes. In: Proceedings of ACM SIGGRAPH, New Orleans, Louisiana, USA, 1996. 99 108.
  • 4Remolar I, Chover M, Belmonte O, et al. Geometric simplification of foliage. In: Proceedings of Eurographics Short Presentations, Saarbrficken, Germany, 2002. 397-404.
  • 5Decaudin P, Neyret F. Rendering forest scenes in real-time. In: Proceedings of Eurographics Workshop on Rendering, Norkoping, Sweden, 2004. 93- 102.
  • 6Meyer A, Neyret F, Poulin P. Interactive rendering of trees with shading and shadows. In: Proceedings of Eurographics Workshop on Rendering, London, UK, 2001. 183-196.
  • 7Jakulin A. Interactive vegetation rendering with slicing and blending. In: Proceedings of Eurographics 2000 (Short Presentations), Brno, Czech Republic, 2000.
  • 8Decoret X, Durand F, Sillion F X, et al. Billboard clouds for extreme model simplification. ACM Trans Graph, 2003, 22:689-696.
  • 9Fuhrmann A, Umlauf E, Mantler S. Extreme model simplification for forest rendering. In: Proceedings of Eurographics Workshop on Natural Phenomena, Dublin, Ireland, 2005. 57-66.
  • 10Lacewell J D and Edwards D, Shirley P, et al. Stochastic billboard clouds for interactive foliage rendering. J Graph Tool, 2006, 11:1-12.

共引文献3

同被引文献103

引证文献7

二级引证文献24

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部