任意曲面离散求交的投影算法及其实现  

A Projection Algorithm and Implementation for Subdivided Finding of Surface-Surface Intersections

作　　者：王洪亮[1] 王小椿[1] 

机构地区：[1]西安交通大学机械学院,西安710049

出　　处：《机械科学与技术》2001年第4期507-509,共3页Mechanical Science and Technology for Aerospace Engineering

摘　　要：提出一种任意曲面离散求交的投影算法。曲面首先被离散为一系列三角形平面子面片 ,然后将这些平面三角形面元分别投影到正投影面和水平投影面上 ,再将得到的两个投影映射到二维空间。在二维空间 ,求出两相交三角形的交线段 ,其集合就是两曲面交线的逼近。在详细描述算法原理后 。This paper proposed a projection algorithm for the subdivided finding of surface - surface intersections. Surfaces are first divided into planar triangular sub-patches, the triangles are then projected on vertical plane and horizontal plane, respectively. Two orthographic views obtained are mapped on to a new coordinate system in two dimensions. The line-segment between two planar triangles is easily evaluated in two dimension system. The set of line-segments thus obtained approximate the curves between two surfaces. The algorithm can be used for any types of surface. Both principle and implementation of the algorithm are included.

关 键 词：曲面求交 投影 交线段 相贯点 

分 类 号：TP391.7[自动化与计算机技术—计算机应用技术] O185[自动化与计算机技术—计算机科学与技术]