원문정보
초록
영어
Based on the unique geometric features of the ruled surface, a new efficient algorithm for ruled surface/plane intersection is proposed. The ruled surface is firstly dispersed into a set of line segments, and the ruled surface/plane intersection is transformed to the intersection of a group line segments with a plane. Then a set of ordered intersection points can be obtained by the proposed line/plane intersection algorithm. According to the serial number of every intersection point, all the intersection points are grouped and reorganized. Each group point corresponds to an intersection curve. All the intersection curves can be reconstructed by curve interpolation. Compared with the traditional tracing method, the proposed algorithm can avoid complex calculation including initial points searching and intersection points sorting, which is more efficient and stable.
목차
1. Introduction
2. Intersection of a Line Segment with a Surface
2.1. Intersection of a line segment with a plane
2.2. Intersection of a line segment with a freeform surface
3. Intersection of a Ruled Surface with a Plane
3.1. Discretization of a ruled surface
3.2. Reconstruction of the intersection curve
4. Case study
5. Conclusions
Acknowledgements
References