检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]解放军理工大学指挥自动化学院,江苏南京210007
出 处:《计算机技术与发展》2012年第4期37-40,共4页Computer Technology and Development
基 金:国家自然科学基金资助项目(60303023)
摘 要:传统的压缩算法在实际模型上应用时经常出现"空洞"和面重叠等问题,通过在.x、.obj、.3ds、.max等模型实例上实验发现,出现上述问题的主要原因在于几何相似点,这些点在压缩过程中出现了偏差。文中提出了一种改进的压缩算法,该算法首先利用八叉树切分空间确定几何相似点,然后针对几何相似点采用一系列策略,使它们在压缩过程中仍然保持良好的几何连续性。对比实验表明,该算法不仅能克服传统算法出现的问题,还能更好地保持模型的整体性与连贯性。Applying traditional algorithm in real models often leads to some problems such as faces overlaps and "holes".Found this was because of those geometrically similar points which often resulted in wrong positions during simplification.Then propose a new algorithm.This algorithm searches geometrically similar points by the way of partitioning space with octonary tree,then put an emphases on those geometrically similar points and maintain their geometric continuity during simplification from some strategies.Experiments showed that the new algorithm could overcome those shortcomings and besides produced better integrality and consistency comparing with traditional algorithms.
分 类 号:TP31[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.133.83.123