摘要
传统的基于面模型的切割算法容易产生劣质三角形,且运行效率不高,因此提出顶点移动的算法解决该问题。该算法首先确定切割路径,求出相交交点;根据判定准则确定需要移动的顶点;对移动顶点后的面模型进行网格重构。分别从算法的运行效率和切割后的效果演示2个方面将传统算法与移动顶点算法进行了全面的比较。利用VC和OpenGL对算法进行了验证,结果表明,采用顶点移动算法对于多次切割和复杂模型可以大大提高运行效率,且可获得良好的虚拟切割效果。
The traditional algorithm of cutting produces misshapen triangles and low efficiency. Therefore, transferring vertices is introduced in this paper to solve the above problems. First of all, cutting path is certain to intersection of point; transferring vertices are received according to rules to be described in this paper; grid reconstruction is necessary for facet model. Additionally, the efficiency and effect of cutting are compared between the traditional algorithm and the transferring vertices. The algo- rithm is implemented by VC and OpenGL. The result shows that the transferring vertices algorithm for multi -cutting and complex models can receive high efficiency and good virtual cutting effect.
出处
《系统仿真技术》
2008年第2期117-121,126,共6页
System Simulation Technology
基金
国家自然科学基金资助项目(30770559)
山东省教育厅科技攻关资助项目(J07YJ20)
关键词
顶点移动
虚拟切割
面模型
分离
vertices transferring
virtual cutting
surface-facet model
separate