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 1 2017

Fingerprint

Splines
Conjugate gradient method
Reverse engineering
Computer graphics
Computer aided design
Topology

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

FasTFit : A fast T-spline fitting algorithm. / Feng, Chen; Taguchi, Yuichi.

In: CAD Computer Aided Design, Vol. 92, 01.11.2017, p. 11-21.

Research output: Contribution to journalArticle

Feng, Chen ; Taguchi, Yuichi. / FasTFit : A fast T-spline fitting algorithm. In: CAD Computer Aided Design. 2017 ; Vol. 92. pp. 11-21.
@article{90f3aa65df74458cb679b97d633ef9ae,
title = "FasTFit: A fast T-spline fitting algorithm",
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.",
keywords = "B{\'e}zier patch, Point clouds, Surface fitting, T-spline",
author = "Chen Feng and Yuichi Taguchi",
year = "2017",
month = "11",
day = "1",
doi = "10.1016/j.cad.2017.07.002",
language = "English (US)",
volume = "92",
pages = "11--21",
journal = "CAD Computer Aided Design",
issn = "0010-4485",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - FasTFit

T2 - A fast T-spline fitting algorithm

AU - Feng, Chen

AU - Taguchi, Yuichi

PY - 2017/11/1

Y1 - 2017/11/1

N2 - 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.

AB - 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.

KW - Bézier patch

KW - Point clouds

KW - Surface fitting

KW - T-spline

UR - http://www.scopus.com/inward/record.url?scp=85026887804&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85026887804&partnerID=8YFLogxK

U2 - 10.1016/j.cad.2017.07.002

DO - 10.1016/j.cad.2017.07.002

M3 - Article

VL - 92

SP - 11

EP - 21

JO - CAD Computer Aided Design

JF - CAD Computer Aided Design

SN - 0010-4485

ER -