期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
基于模版的三角网格拓扑压缩 被引量:6
1
作者 刘迎 刘学慧 吴恩华 《计算机辅助设计与图形学学报》 EI CSCD 北大核心 2007年第6期703-707,共5页
提出一种基于面的高效三角网格拓扑压缩算法.该算法是单分辨率无损压缩算法,是对Edgebreaker算法的改进:在网格遍历部分,通过自适应网格遍历方法使非常影响压缩比的分割图形操作尽可能少;在熵编码部分,为网格遍历后得到的每个操作符各... 提出一种基于面的高效三角网格拓扑压缩算法.该算法是单分辨率无损压缩算法,是对Edgebreaker算法的改进:在网格遍历部分,通过自适应网格遍历方法使非常影响压缩比的分割图形操作尽可能少;在熵编码部分,为网格遍历后得到的每个操作符各设计一个模版,根据模版确定该操作符的二进制表示,然后采用自适应算术编码方法压缩该二进制表示得到最后的压缩结果.与网格拓扑压缩领域中基于面的最好的算法得到的压缩比相比较,该算法得到的压缩比有很大提高. 展开更多
关键词 edgebreaker 模版 算术编码 网格 拓扑压缩 编码 解码
下载PDF
Connectivity-Based Segmentation for GPU-Accelerated Mesh Decompression 被引量:7
2
作者 赵杰伊 唐敏 童若锋 《Journal of Computer Science & Technology》 SCIE EI CSCD 2012年第6期1110-1118,共9页
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... 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. 展开更多
关键词 parallel decompression mesh segmentation connectivity compression GPU edgebreaker
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部