局部求精算法中的纹理动态拼装*

作者：梁 策，潘万彬 日期：2010-11-16/span> 浏览：3679 查看PDF文档

局部求精算法中的纹理动态拼装*

梁 策，潘万彬

(杭州电子科技大学 计算机科学与技术系，浙江 杭州 310018)

摘要：模型的简化有时会导致用户所关注的模型细节的丢失。为了保持这些重要的细节，使用了局部求精的方法，在模型简化后，有选择性地恢复用户所关注区域的细节，并实现了在局域求精时对网格模型的动态修改。若模型附有纹理信息，则对简化模型重新映射其纹理，以实现纹理的优化。首先对模型进行分割从而形成一系列网格片，将它们参数化到纹理空间后使用了正方形贪心排列算法进行重排，得到排列更加紧凑、高效的纹理图。研究结果表明，该算法实现了对简化模型纹理的重新映射。
关键词：三维几何模型；局部求精；图块拼装；区域分割
中图分类号：TP391.41
文献标识码：A文章编号：1001-4551(2010)09-0120-03

Dynamic texture packing during the region refinement
LIANG Ce, PAN Wanbing
(Department of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou 310018, China)

Abstract: During the mesh simplification, some details the users concerned may be lost. In order to maintain these important details, local refinement was used to refine the region selectively which the users were interested. In this way, special details can be reserved. If there was texture on the models, the texture should be remapped in order to get an optimal texture for the simplified model. For realizing the texture remapping, the models surfaces were partitioned into many diskslike charts parameterized into squares. And the squares were packed in to the texture space by a greedy algorithm. The results indicate that it can improve and optimize the utilization of the texture and modify charts dynamically generated by models partition during region refinement process.
Key words: 3D geometric model; selective refinement; chart packing; regions partition