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

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)14-23
Number of pages10
JournalJournal of Computational Design and Engineering
Volume3
Issue number1
DOIs
StatePublished - 1 Jan 2016
Externally publishedYes

Keywords

  • B-spline
  • Curve fitting
  • Curve reconstruction
  • Point cloud

Fingerprint

Dive into the research topics of 'A graph-based method for fitting planar B-spline curves with intersections'. Together they form a unique fingerprint.

Cite this