FasTFit: A fast T-spline fitting algorithm

Chen Feng, Yuichi Taguchi

Research output: Contribution to journalArticle

Abstract

T-spline has been recently developed to represent objects of arbitrary shapes using a smaller number of control points than the conventional NURBS or B-spline representations in computer aided design, computer graphics, and reverse engineering. However, existing methods for fitting a T-spline over a point cloud are slow. By shifting away from the conventional iterative fit-and-refine paradigm, we present a novel split-connect-fit algorithm to more efficiently perform the T-spline fitting. Through adaptively dividing a point cloud into a set of B-spline patches, we first discover a proper topology of T-spline control points, i.e., the T-mesh. We then connect these B-spline patches into a single T-spline surface with different continuity options between neighboring patches according to the data. The T-spline control points are initialized from their correspondences in the B-spline patches, which are refined by using a conjugate gradient method. In experiments using several types of large-sized point clouds, we demonstrate that our algorithm is at least an order of magnitude faster than state-of-the-art algorithms while provides comparable or better results in terms of quality and conciseness.

Original languageEnglish (US)
Pages (from-to)11-21
Number of pages11
JournalCAD Computer Aided Design
Volume92
DOIs
StatePublished - Nov 2017

    Fingerprint

Keywords

  • Bézier patch
  • Point clouds
  • Surface fitting
  • T-spline

ASJC Scopus subject areas

  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design
  • Industrial and Manufacturing Engineering

Cite this