Browse > Article
http://dx.doi.org/10.1016/j.jcde.2015.05.001

A graph-based method for fitting planar B-spline curves with intersections  

Bon, Pengbo (School of Computer Science and Technology, Harbin Institute of Technology)
Luo, Gongning (School of Computer Science and Technology, Harbin Institute of Technology)
Wang, Kuanquan (School of Computer Science and Technology, Harbin Institute of Technology)
Publication Information
Journal of Computational Design and Engineering / v.3, no.1, 2016 , pp. 14-23 More about this Journal
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.
Keywords
Curve fitting; Curve reconstruction; B-spline; Point cloud;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Goshtasby AA. Grouping and parameterizing irregularly spaced points for curve fitting. ACM Transactions on Graphics (TOG) 2000;19(3)185-203.   DOI
2 Furferi R, Governi L, Palai M, Volpe Y. From unordered point cloud to weighted b-spline-a novel pca-based method. In: Proceedings of the 2011 American Conference on Applied Mathematics and The 5th WSEAS International Conference on Computer Engineering and Applications, World Scientific and Engineering Academy and Society (WSEAS), Stevens Point, Wisconsin, USA; 2011; p. 146-51.
3 Yan H. Fuzzy curve-tracing algorithm. IEEE Transactions on Cyber-netics, Systems, Man, and Cybernetics, Part B: Cybernetics 2001(5):768-80.
4 Zhao Y-d, Cao J-j, Su Z-x, Li Z-y. Efficient reconstruction of non-simple curves. Journal of Zhejiang University-SCIENCE C 2011;12(7) 523-32 http://dx.doi.org/10.1631/jzus.C1000308.   DOI
5 Levin D. The approximation power of moving least-squares. Mathematics of Computation of the American Mathematical Society 1998;67(224)1517-31.   DOI
6 Lee I-K. Curve reconstruction from unorganized points. Computer Aided Geometric Design 2000;17(2)161-77.   DOI
7 Pottmann H, Leopoldseder S, Hofer M. Approximation with active b-spline curves and surfaces. In: Proceedings of the 10th Pacific Conference on Computer Graphics and Applications. Washington, DC, USA; IEEE Computer Society; 2002; p. 8-18.
8 Wang W, Pottmann H, Liu Y. Fitting b-spline curves to point clouds by curvature-based squared distance minimization. ACM Transactions on Graphics (TOG) 2006;25(2)214-38.   DOI
9 Zhang T, Suen CY. A fast parallel algorithm for thinning digital patterns. Communications of the ACM 1984;27(3)236-9.   DOI
10 Song Y. Boundary fitting for 2d curve reconstruction. The Visual Computer 2010;26(3)187-204.   DOI
11 Dey TK, Zhao W. Approximate medial axis as a voronoi subcomplex. Computer-Aided Design 2004;36(2)195-202.   DOI
12 Zhu Y, Sun F, Choi Y-K, Juttler B, Wang W. Spline approximation to medial axis. CoRR abs/1307.0118.
13 Aichholzer O, Aigner W, Aurenhammer F, Hackl T, Juttler B, Rabl M. Medial axis computation for planar free-form shapes. Computer-Aided Design 2009;41(5)339-49.   DOI
14 Ramel J-Y, Vincent N, Emptoz H. A structural representation for understanding line-drawing images. International Journal on Document Analysis and Recognition 2000;3(2)58-66.   DOI
15 Noris G, Hornung A, Sumner RW, Simmons M, Gross M. Topology- driven vectorization of clean line drawings. ACM Transactions on Graphics (TOG) 2013;32(1)4.
16 Zou JJ, Yan H. Extracting strokes from static line images based on selective searching. Pattern Recognition 1999;32(6)935-46.   DOI
17 Melhi M, Ipson SS, Booth W. A novel triangulation procedure for thinning hand-written text. Pattern Recognition Letters 2001;22(10)1059-71.   DOI
18 Dey TK, Wenger R. Reconstructing curves with sharp corners. Computa-tional Geometry 2001;19(2-3)89-99.   DOI
19 Zitnick CL. Handwriting beautification using token means. ACM Transactions on Graphics 2013;32(4)53:1-8.
20 de Goes F, Cohen-Steiner D, Alliez P, Desbrun M. An optimal transport approach to robust reconstruction and simplification of 2d shapes. Computer Graphics Forum 2011;30(5)1593-602.   DOI
21 Zhu D, Bo P, Zhou Y, Zhang C, Wang K. Fitting multiple curves to point clouds with complicated topological structures. In: The 13th International Conference on Computer-Aided Design and Computer Graphics; 2013; p. 60-7.
22 Dey TK, Kumar P. A simple provable algorithm for curve reconstruction. In: SODA; 1999; p. 893-4.
23 Wang J, Yu Z, Zhang W, Wei M, Tan C, Dai, N, et al. Robust reconstruction of 2d curves from scattered noisy point data. Computer-Aided Design 2014;50:27-40.   DOI
24 Ruiz O, Vanegas C, Cadavid C. Ellipse-based principal component analysis for self-intersecting curve reconstruction from noisy point sets. The Visual Computer 2011;27(3)211-26.   DOI
25 Einbeck J, Tutz G, Evers L. Local principal curves. Statistics and Computing 2005;15(4)301-13.   DOI
26 Amenta N, Bern M, Eppstein D. The crust and the ${\beta}$-skeleton: combinatorial curve reconstruction. Graphical Models and Image Processing 1998;60(2)125-35.   DOI