B-spline surface fitting by iterative geometric interpolation/approximation algorithms

Yuki Kineri, Mingsi Wang, Hongwei Lin, Takashi Maekawa

Research output: Contribution to journalArticle

36 Citations (Scopus)

Abstract

Recently, the use of B-spline curves/surfaces to fit point clouds by iteratively repositioning the B-spline's control points on the basis of geometrical rules has gained in popularity because of its simplicity, scalability, and generality. We distinguish between two types of fitting, interpolation and approximation. Interpolation generates a B-spline surface that passes through the data points, whereas approximation generates a B-spline surface that passes near the data points, minimizing the deviation of the surface from the data points. For surface interpolation, the data points are assumed to be in grids, whereas for surface approximation the data points are assumed to be randomly distributed. In this paper, an iterative geometric interpolation method, as well as an approximation method, which is based on the framework of the iterative geometric interpolation algorithm, is discussed. These two iterative methods are compared with standard fitting methods using some complex examples, and the advantages and shortcomings of our algorithms are discussed. Furthermore, we introduce two methods to accelerate the iterative geometric interpolation algorithm, as well as a method to impose geometric constraints, such as reflectional symmetry, on the iterative geometric interpolation process, and a novel fairing method for non-uniform complex data points. Complex examples are provided to demonstrate the effectiveness of the proposed algorithms.

Original languageEnglish
Pages (from-to)697-708
Number of pages12
JournalCAD Computer Aided Design
Volume44
Issue number7
DOIs
Publication statusPublished - 2012 Jul 1
Externally publishedYes

Fingerprint

Approximation algorithms
Splines
Interpolation
Iterative methods
Scalability

Keywords

  • Approximation
  • B-spline surfaces
  • Interpolation
  • Iterative geometric fitting algorithm

ASJC Scopus subject areas

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

Cite this

B-spline surface fitting by iterative geometric interpolation/approximation algorithms. / Kineri, Yuki; Wang, Mingsi; Lin, Hongwei; Maekawa, Takashi.

In: CAD Computer Aided Design, Vol. 44, No. 7, 01.07.2012, p. 697-708.

Research output: Contribution to journalArticle

Kineri, Yuki ; Wang, Mingsi ; Lin, Hongwei ; Maekawa, Takashi. / B-spline surface fitting by iterative geometric interpolation/approximation algorithms. In: CAD Computer Aided Design. 2012 ; Vol. 44, No. 7. pp. 697-708.
@article{7c1c6db3ab284cf08a290e26ac92df83,
title = "B-spline surface fitting by iterative geometric interpolation/approximation algorithms",
abstract = "Recently, the use of B-spline curves/surfaces to fit point clouds by iteratively repositioning the B-spline's control points on the basis of geometrical rules has gained in popularity because of its simplicity, scalability, and generality. We distinguish between two types of fitting, interpolation and approximation. Interpolation generates a B-spline surface that passes through the data points, whereas approximation generates a B-spline surface that passes near the data points, minimizing the deviation of the surface from the data points. For surface interpolation, the data points are assumed to be in grids, whereas for surface approximation the data points are assumed to be randomly distributed. In this paper, an iterative geometric interpolation method, as well as an approximation method, which is based on the framework of the iterative geometric interpolation algorithm, is discussed. These two iterative methods are compared with standard fitting methods using some complex examples, and the advantages and shortcomings of our algorithms are discussed. Furthermore, we introduce two methods to accelerate the iterative geometric interpolation algorithm, as well as a method to impose geometric constraints, such as reflectional symmetry, on the iterative geometric interpolation process, and a novel fairing method for non-uniform complex data points. Complex examples are provided to demonstrate the effectiveness of the proposed algorithms.",
keywords = "Approximation, B-spline surfaces, Interpolation, Iterative geometric fitting algorithm",
author = "Yuki Kineri and Mingsi Wang and Hongwei Lin and Takashi Maekawa",
year = "2012",
month = "7",
day = "1",
doi = "10.1016/j.cad.2012.02.011",
language = "English",
volume = "44",
pages = "697--708",
journal = "CAD Computer Aided Design",
issn = "0010-4485",
publisher = "Elsevier Limited",
number = "7",

}

TY - JOUR

T1 - B-spline surface fitting by iterative geometric interpolation/approximation algorithms

AU - Kineri, Yuki

AU - Wang, Mingsi

AU - Lin, Hongwei

AU - Maekawa, Takashi

PY - 2012/7/1

Y1 - 2012/7/1

N2 - Recently, the use of B-spline curves/surfaces to fit point clouds by iteratively repositioning the B-spline's control points on the basis of geometrical rules has gained in popularity because of its simplicity, scalability, and generality. We distinguish between two types of fitting, interpolation and approximation. Interpolation generates a B-spline surface that passes through the data points, whereas approximation generates a B-spline surface that passes near the data points, minimizing the deviation of the surface from the data points. For surface interpolation, the data points are assumed to be in grids, whereas for surface approximation the data points are assumed to be randomly distributed. In this paper, an iterative geometric interpolation method, as well as an approximation method, which is based on the framework of the iterative geometric interpolation algorithm, is discussed. These two iterative methods are compared with standard fitting methods using some complex examples, and the advantages and shortcomings of our algorithms are discussed. Furthermore, we introduce two methods to accelerate the iterative geometric interpolation algorithm, as well as a method to impose geometric constraints, such as reflectional symmetry, on the iterative geometric interpolation process, and a novel fairing method for non-uniform complex data points. Complex examples are provided to demonstrate the effectiveness of the proposed algorithms.

AB - Recently, the use of B-spline curves/surfaces to fit point clouds by iteratively repositioning the B-spline's control points on the basis of geometrical rules has gained in popularity because of its simplicity, scalability, and generality. We distinguish between two types of fitting, interpolation and approximation. Interpolation generates a B-spline surface that passes through the data points, whereas approximation generates a B-spline surface that passes near the data points, minimizing the deviation of the surface from the data points. For surface interpolation, the data points are assumed to be in grids, whereas for surface approximation the data points are assumed to be randomly distributed. In this paper, an iterative geometric interpolation method, as well as an approximation method, which is based on the framework of the iterative geometric interpolation algorithm, is discussed. These two iterative methods are compared with standard fitting methods using some complex examples, and the advantages and shortcomings of our algorithms are discussed. Furthermore, we introduce two methods to accelerate the iterative geometric interpolation algorithm, as well as a method to impose geometric constraints, such as reflectional symmetry, on the iterative geometric interpolation process, and a novel fairing method for non-uniform complex data points. Complex examples are provided to demonstrate the effectiveness of the proposed algorithms.

KW - Approximation

KW - B-spline surfaces

KW - Interpolation

KW - Iterative geometric fitting algorithm

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

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

U2 - 10.1016/j.cad.2012.02.011

DO - 10.1016/j.cad.2012.02.011

M3 - Article

VL - 44

SP - 697

EP - 708

JO - CAD Computer Aided Design

JF - CAD Computer Aided Design

SN - 0010-4485

IS - 7

ER -