Interpolation by geometric algorithm

Takashi Maekawa, Yasunori Matsumoto, Ken Namiki

Research output: Contribution to journalArticle

59 Citations (Scopus)

Abstract

We present a novel geometric algorithm to construct a smooth surface that interpolates a triangular or a quadrilateral mesh of arbitrary topological type formed by n vertices. Although our method can be applied to B-spline surfaces and subdivision surfaces of all kinds, we illustrate our algorithm focusing on Loop subdivision surfaces as most of the meshes are in triangular form. We start our algorithm by assuming that the given triangular mesh is a control net of a Loop subdivision surface. The control points are iteratively updated globally by a simple local point-surface distance computation and an offsetting procedure without solving a linear system. The complexity of our algorithm is O (m n) where n is the number of vertices and m is the number of iterations. The number of iterations m depends on the fineness of the mesh and accuracy required.

Original languageEnglish
Pages (from-to)313-323
Number of pages11
JournalCAD Computer Aided Design
Volume39
Issue number4
DOIs
Publication statusPublished - 2007 Apr 1
Externally publishedYes

Fingerprint

Subdivision Surfaces
Geometric Algorithms
Interpolation
Interpolate
Triangular
Mesh
Quadrilateral Mesh
Iteration
B-spline Surface
Triangular Mesh
Smooth surface
Control Points
Linear Systems
Arbitrary
Splines
Linear systems

Keywords

  • B-spline curves and surfaces
  • Catmull-Clark subdivision surface
  • Geometric algorithm
  • Geometric modeling
  • Loop subdivision surface
  • Surface interpolation

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Industrial and Manufacturing Engineering
  • Geometry and Topology

Cite this

Interpolation by geometric algorithm. / Maekawa, Takashi; Matsumoto, Yasunori; Namiki, Ken.

In: CAD Computer Aided Design, Vol. 39, No. 4, 01.04.2007, p. 313-323.

Research output: Contribution to journalArticle

Maekawa, Takashi ; Matsumoto, Yasunori ; Namiki, Ken. / Interpolation by geometric algorithm. In: CAD Computer Aided Design. 2007 ; Vol. 39, No. 4. pp. 313-323.
@article{e3b555d8328645d7b0fa5d3548a13b45,
title = "Interpolation by geometric algorithm",
abstract = "We present a novel geometric algorithm to construct a smooth surface that interpolates a triangular or a quadrilateral mesh of arbitrary topological type formed by n vertices. Although our method can be applied to B-spline surfaces and subdivision surfaces of all kinds, we illustrate our algorithm focusing on Loop subdivision surfaces as most of the meshes are in triangular form. We start our algorithm by assuming that the given triangular mesh is a control net of a Loop subdivision surface. The control points are iteratively updated globally by a simple local point-surface distance computation and an offsetting procedure without solving a linear system. The complexity of our algorithm is O (m n) where n is the number of vertices and m is the number of iterations. The number of iterations m depends on the fineness of the mesh and accuracy required.",
keywords = "B-spline curves and surfaces, Catmull-Clark subdivision surface, Geometric algorithm, Geometric modeling, Loop subdivision surface, Surface interpolation",
author = "Takashi Maekawa and Yasunori Matsumoto and Ken Namiki",
year = "2007",
month = "4",
day = "1",
doi = "10.1016/j.cad.2006.12.008",
language = "English",
volume = "39",
pages = "313--323",
journal = "CAD Computer Aided Design",
issn = "0010-4485",
publisher = "Elsevier Limited",
number = "4",

}

TY - JOUR

T1 - Interpolation by geometric algorithm

AU - Maekawa, Takashi

AU - Matsumoto, Yasunori

AU - Namiki, Ken

PY - 2007/4/1

Y1 - 2007/4/1

N2 - We present a novel geometric algorithm to construct a smooth surface that interpolates a triangular or a quadrilateral mesh of arbitrary topological type formed by n vertices. Although our method can be applied to B-spline surfaces and subdivision surfaces of all kinds, we illustrate our algorithm focusing on Loop subdivision surfaces as most of the meshes are in triangular form. We start our algorithm by assuming that the given triangular mesh is a control net of a Loop subdivision surface. The control points are iteratively updated globally by a simple local point-surface distance computation and an offsetting procedure without solving a linear system. The complexity of our algorithm is O (m n) where n is the number of vertices and m is the number of iterations. The number of iterations m depends on the fineness of the mesh and accuracy required.

AB - We present a novel geometric algorithm to construct a smooth surface that interpolates a triangular or a quadrilateral mesh of arbitrary topological type formed by n vertices. Although our method can be applied to B-spline surfaces and subdivision surfaces of all kinds, we illustrate our algorithm focusing on Loop subdivision surfaces as most of the meshes are in triangular form. We start our algorithm by assuming that the given triangular mesh is a control net of a Loop subdivision surface. The control points are iteratively updated globally by a simple local point-surface distance computation and an offsetting procedure without solving a linear system. The complexity of our algorithm is O (m n) where n is the number of vertices and m is the number of iterations. The number of iterations m depends on the fineness of the mesh and accuracy required.

KW - B-spline curves and surfaces

KW - Catmull-Clark subdivision surface

KW - Geometric algorithm

KW - Geometric modeling

KW - Loop subdivision surface

KW - Surface interpolation

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

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

U2 - 10.1016/j.cad.2006.12.008

DO - 10.1016/j.cad.2006.12.008

M3 - Article

VL - 39

SP - 313

EP - 323

JO - CAD Computer Aided Design

JF - CAD Computer Aided Design

SN - 0010-4485

IS - 4

ER -