Interpolation by geometric algorithm

Takashi Maekawa, Yasunori Matsumoto, Ken Namiki

研究成果: Article査読

68 被引用数 (Scopus)


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.

ジャーナルCAD Computer Aided Design
出版ステータスPublished - 2007 4

ASJC Scopus subject areas

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

フィンガープリント 「Interpolation by geometric algorithm」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。