常用代数曲面求交新算法  

A New Algorithm for Computing Usual Algebraic Surface Intersections

作　　者：杨益梅[1] 谌炎辉[2] 

机构地区：[1]湖南工学院(筹),湖南衡阳421101 [2]湘潭大学机械工程学院,湖南湘潭411105

出　　处：《机械制造与自动化》2006年第1期41-43,47,共4页Machine Building & Automation

摘　　要：提出了一种新的基于“结式法”的常用代数曲面求交算法,该算法首先利用结式法计算出两个曲面相交时交线的投影方程,再对投影方程进行分解等处理。通过循环计算从而得到投影交线的分支数及一系列的点,然后再代入相交的二次曲面方程即可得到两曲面的交线。该算法实现简单且符合求交算法的稳定、准确和快速等要求。This paper presents a new algorithm for computing the intersection of two usual algebraic surfaces, which based on the resultant method. The algorithm uses the resultant method to compute the intersection＇s projection equation and deals with the projection equation through decomposition and so on. Then, get the branch numbers of the projection intersecting line and a series of points of it through the repeating computing, and get the projection intersecting line through recurring to one of the surface. The algorithm is simply and realization is easy, and has been proved to be reliable, efficient and accurate.

关 键 词：结式法 代数曲面 算法 投影 求交 CAD 

分 类 号：TH123.1[机械工程—机械设计及理论]