Metamorphosis of Arbitrary Triangular Meshes

نویسندگان

  • Takashi Kanai
  • Hiromasa Suzuki
  • Fumihiko Kimura
چکیده

Recently, animations with deforming objects have been frequently used in various computer graphics applications. Metamorphosis (or morphing) of three-dimensional objects is one of the techniques which realizes shape transformation between two or more existing objects. In this paper, we present an efficient framework for metamorphosis between two topologically equivalent, arbitrary meshes with the control of surface correspondences by the user. The basic idea of our method is to partition meshes according to the reference shapes specified by the user, whereby vertex-to-vertex correspondences between the two meshes can be specified. Each of the partitioned meshes is embedded into a polygonal region on the plane with harmonic mapping. Those embedded meshes have the same graph structure as their original meshes. By overlapping those two embedded meshes, we can establish correspondence between them. Based on this correspondence, metamorphosis is achieved by interpolating the corresponding vertices from one mesh to the other. We demonstrate that the minimum control of surface correspondences by the user generates sophisticated results of the interpolation between two meshes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Navigation Queries from Triangular Meshes

Navigation meshes are commonly employed as a practical representation for path planning and other navigation queries in animated virtual environments and computer games. This paper explores the use of triangulations as a navigation mesh, and discusses several useful triangulation–based algorithms and operations: environment modeling and validity, automatic agent placement, tracking moving obsta...

متن کامل

Quality improvement of surface triangular mesh using a modified Laplacian smoothing approach avoiding intersection

We present a systematic procedure to improve the qualities of triangular molecular surface meshes and at the same time preserve the manifoldness. The procedure utilizes an algorithm to remove redundant points having three or four valences and another algorithm to smooth the mesh using a modified version of Laplacian method without causing intersecting triangles. This approach can be effectively...

متن کامل

Monotone finite volume schemes for diffusion equations on unstructured triangular and shape-regular polygonal meshes

We consider a nonlinear finite volume (FV) scheme for stationary diffusion equation. We prove that the scheme is monotone, i.e. it preserves positivity of analytical solutions on arbitrary triangular meshes for strongly anisotropic and heterogeneous full tensor coefficients. The scheme is extended to regular star-shaped polygonal meshes and isotropic heterogeneous coefficients.

متن کامل

Error Estimates of Morley Triangular Element Satisfying the Maximal Angle Condition

In this paper, we establish the convergence of a nonconforming triangular Morley element for the plate bending problem for some degenerate meshes. An explicit bound for the interpolation error is derived for arbitrary triangular meshes without any assumptions. The optimal convergence rates of moment error and rotation error are derived for triangular meshes satisfying the maximal angle conditio...

متن کامل

Pressure-Velocity Coupled Finite Volume Solution of Steady Incompressible Invscid Flow Using Artificial Compressibility Technique

Application of the computer simulation for solving the incompressible flow problems motivates developing efficient and accurate numerical models. The set of Inviscid Incompressible Euler equations can be applied for wide range of engineering applications. For the steady state problems, the equation of continuity can be simultaneously solved with the equations of motion in a coupled manner using...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Computer Graphics and Applications

دوره 20  شماره 

صفحات  -

تاریخ انتشار 2000