Authors: Zheng-Sheng Yu, Min-jae Oh, Zhi-Geng Pan, Qun-Sheng Peng
Addresses: Institute of Graphics and Image, Hangzhou Dianzi University, Hangzhou 310018, P. R. China. ' Department of Naval Architecture and Ocean Engineering, Seoul National University, Seoul, Korea. ' State Key Laboratory of CAD&CG of Zhejiang University, Hangzhou, 310027, P. R. China. ' State Key Laboratory of CAD&CG of Zhejiang University, Hangzhou, 310027, P. R. China
Abstract: A robust algorithm for removing both local and global self intersections in a planar offset curve is presented. Our scheme is based on the minimum distance from a point to an original parametric curve. The method consists of the following two steps: 1) in the 2D plane, generation of the field of minimum distance from a point to an original planar parametric curve, 2) in the field, extraction of the iso-curve, regarding the offset distance as the minimum distance. The iso-curve is the non-self-intersection offset curve. Therefore, the advantage of our method is that the planar offset curve does not need to be approximated by a rational curve; however, both local and global self-intersections in the offset curve can be directly and automatically eliminated.
Keywords: computer graphics; planar parametric curves; planar offset curves; self-intersection; minimum distance; geometric modelling.
International Journal of Computer Aided Engineering and Technology, 2009 Vol.1 No.3, pp.354 - 367
Published online: 12 Jul 2009 *Full-text access for editors Access for subscribers Purchase this article Comment on this article