提出了一个雕塑实体布尔操作中的精确求交算法。
This paper presents an accurate intersection method for Boolean operation of sculptured models.
它采用活性边表法的快速求交算法，提高了网格运算的速度。
The method adopts a quick algorithm for seeking points between lines and polygon and then the speed of grid division is improved greatly.
提出了一种基于牛顿迭代法解方程组的射线和NURBS曲面求交算法。
A fast intersection algorithm for ray and NURBS surface is presented. The algorithm bases on the Newton iteration solution for equation set.
在开发软件原型中，提出了一种进行不规则区域求交的新算法。
During the development of the antitype , proposed a new calculation to seek anomalous area overlapping.
提出一种实现刀具扫描体与曲面矢量求交的有效算法。
An effective algorithm is presented here for seeking and realizing the intersection of tool sweep volume with surface vector.
在此算法的基础上，利用数据结构的理论，实现了任意参数曲面的求交及拼合，并绘出了相应的三维视图。
On the above algorithm basis, according to theory of data structures, the intersection of any parametric surfaces is found and three-dimensional graphs are given.
提出并分析了适合于多面体模型的边界几何求交方法，并进一步给出了融入模型重构的综合算法。
Then it analyzed the boundary geometrical intersection method suitable for a polyhedral model, and further presented a hybrid algorithm that integrates model reconstruction.
提出了一种用于实现矢量与扫描体(代表五轴数控加工铣刀的运动)求交的有效算法。
An efficient algorithm is presented for finding the intersection of vectors with swept volume generated from the five axis NC milling tool motions.
在求交时采用了分割算法，简化了求交计算。
Subdivision algorithm is also used to simplify calculations and save the computation.
跟踪求交是参数曲面求交常用的算法，而对于离散化的曲面也可以采用类似的方法。
A marching method for intersection is a common using algorithm for solving intersection of parametric surfaces, as well as that of discrete surfaces.
拓展了我们已有的平面上单调链求交的扫描线算法，将其应用到初步等距线中的全局自交点和全局无效环的确定上。
The algorithm proposed by us for polygonal chains intersection based on the sweep line algorithm is extended, and it is used to detect and delete global self-intersections in the rough offset curve.
在跟踪求交的算法中充分利用了交线的几何特性，按等弓高误差快速精确地求取曲面上的交线。
The algorithm makes full use of geometric information of intersecting lines to speed up the calculation according to the arc height tolerance.
实验的结果表明，改进的算法提高了采用空间分解进行三角网格求交的计算效率。
Experiments show that the new method can improve the efficiency of computing triangular mesh intersections based on space division.
提出了一种利用密切平面对两自由曲面进行追踪求交的算法。
A tracing algorithm for calculating the intersection curves of two free-form surfaces by using their osculating plane is presented in this paper.
提出的降维算法，避免了求交的盲目性，提高了速度，而且 不需要过多的附加运算。
The declines dimension algorithm presented in this paper avoids the blindness in begging to hand over, increases speed and omitts the need for excessive affixture calculation.
作者在对已有的多边形填充算法深入研究的基础上，给出了一种称之为“完全记忆求交法”的新的多边形填充算法。新算法较已有算法有更高的效率。
Base on the research for the algorithm, which have had, of filling up polygon, Authors give a new algorithm, to be known as "the algorithm to calculate points of intersection with completely memory".
首先介绍了一种光线与三角形求交的简洁算法。
First of all, a minimum storage ray triangle intersection was introduced.
首先介绍了一种光线与三角形求交的简洁算法。
First of all, a minimum storage ray triangle intersection was introduced.
应用推荐