A graph-based method for fitting planar B-spline curves with intersections. Issue 1 (10th June 2015)

• Record Type: Journal Article
• Authors: Bo, Pengbo; Luo, Gongning; Wang, Kuanquan
• Is Part Of: Journal of computational design and engineering. Volume 3:Issue 1(2016)
• Page Start: 14
• Page End: 23
• Publication Date: 2015-06-10
• Subjects: Curve fitting -- Curve reconstruction -- B-spline -- Point cloud; Engineering -- Data processing -- Periodicals; Computer-aided design -- Periodicals; Computer-aided design; Engineering -- Data processing; Electronic journals; Electronic journals; Periodicals; 620.0042
• DOI: 10.1016/j.jcde.2015.05.001
• Languages: English
• ISSNs: 2288-4300

Abstract

Abstract: The problem of fitting B-spline curves to planar point clouds is studied in this paper. A novel method is proposed to deal with the most challenging case where multiple intersecting curves or curves with self-intersection are necessary for shape representation. A method based on Delauney Triangulation of data points is developed to identify connected components which is also capable of removing outliers. A skeleton representation is utilized to represent the topological structure which is further used to create a weighted graph for deciding the merging of curve segments. Different to existing approaches which utilize local shape information near intersections, our method considers shape characteristics of curve segments in a larger scope and is thus capable of giving more satisfactory results. By fitting each group of data points with a B-spline curve, we solve the problems of curve structure reconstruction from point clouds, as well as the vectorization of simple line drawing images by drawing lines reconstruction.