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.
목차
Abstract 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
보안공학연구지원센터(IJSIP) [Science & Engineering Research Support Center, Republic of Korea(IJSIP)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Signal Processing, Image Processing and Pattern Recognition
간기
격월간
pISSN
2005-4254
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Signal Processing, Image Processing and Pattern Recognition Vol.6 No.6