제어로봇시스템학회:학술대회논문집
- 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 22-24 Oct. 1991
- /
- Pages.1617-1622
- /
- 1991
Robust plane sweep algorithm for planar curve segments
- Lee, In-Kwon (Department of Computer Science, POSTECH) ;
- Lee, Hwan-Yong (Department of Computer Science, POSTECH) ;
- Kim, Myung-Soo (Department of Computer Science, POSTECH)
- 발행 : 1991.10.01
초록
Plane sweep is a general method in computational geometry. There are many efficient theoretical algorithms designed using plane sweep technique. However, their practical implementations are still suffering from the topological inconsistencies resulting from the numerical errors in geometric computations with finite-precision arithmetic. In this paper, we suggest new implementation techniques for the plane sweep algorithms to resolve the topological inconsistencies and construct the planar object boundaries from given input curve segments.
키워드