检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《中国图象图形学报》2007年第2期250-255,共6页Journal of Image and Graphics
基 金:国家杰出青年科学基金项目(60525213);国家自然科学基金重点项目(60533030)
摘 要:在移动计算中,3维图形通常是由几何造型的网格来表示。为了解决移动图形的存储、传输和显示问题,提出了一种基于逆细分的构建渐进网格的算法,给出了渐进网格通过网格传输和在移动终端上渲染3维图形的方法。细密的网格通过逐层地、分批地删除其冗余信息,最后生成由基网格和一系列误差值组成的渐进网格。在算法实施时,将Loop逼近型细分模式作为插值型细分模式进行操作。该算法共分3个关键步骤:网格分裂、奇点预测、网格更新。简化后的渐进网格可以无损还原。实验结果表明,该算法效率高,比以往的方法速度快。In Mobile Graphics Computing, 3D graphics is generally illustrated by meshes of 3D geometric model. In order to overcome the difficulty of storage, transmission and rendering for Mobile Graphics, a novel algorithm to construct progressive meshes based on reverse subdivision is proposed. A method for transmission progressive meshes over wirdess network and its rendering on mobile devices is presented. The dense mesh is simplified into coarse base mesh and a series of errors by decimating the redundant information level by level. Loop subdivision scheme, which is an approximating scheme, is adopted as interpolatory one in the simplification process. The implementation of our algorithm consists of three key steps : splitting, predicting and updating. The mesh can be reconstructed lossless. The experimental results show that the algorithm is highly efficient and faster than previous related techniques.
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222