摘要
曲面求交是CAD/CAM领域最为重要也最为复杂的问题之一。在众多的算法中,追踪法由于其易于实现、计算速度快而得到广泛应用,而追踪法最大的缺点在于很难确定每条交线的初始点。针对这个问题,笔者提出了一种专门用于解决圆环面与圆环面求交算法中初始点计算的方法。该算法以几何方法为基础,通过判断圆环中心圆之间的位置关系来判定相交区域,并运用数值分析方法精确计算出每条交线的初始点。
Surface-surface intersection is one of the most important and intricate problems in CAD/CAM field. In many algorithms, marching method is by far most widely used because of its easy implement and faster computation. The biggest disadvantage of this approach is that it is very difficult to get the first point of every intersection-curve. Aiming at smoothing away the disadvantage, we proposed a special algorithm to compute the starting point of torus-torus intersection. The algorithm is based on geometric method, which finds the intersection-area by judging the relative position of two torus center-circles, and uses algebraic method to compute the precise starting point of every intersection curve.
出处
《工程图学学报》
CSCD
2004年第1期47-51,共5页
Journal of Engineering Graphics
关键词
曲面求交
追踪法
几何
切点
小封闭环
圆环
求交算法
初始点
CAD
CAM
computer application
surface-surface intersection
marching method
geometry
tangent point
little closed loop
