## 3D Metamorphosis: a Survey (1998)

Venue: | The Visual Computer |

Citations: | 2 - 0 self |

### BibTeX

@ARTICLE{Lazarus983dmetamorphosis:,

author = {Francis Lazarus and Anne Verroust},

title = {3D Metamorphosis: a Survey},

journal = {The Visual Computer},

year = {1998},

volume = {14},

pages = {8--9}

}

### OpenURL

### Abstract

A metamorphosis or a (3D) morphing is the process of continuously transforming one object into another. 2D and 3D morphing are popular in computer animation, industrial design or growth simulation. Since there is no intrinsic solution to the morphing problem, user interaction can be a key component of a morphing software. Many morphing techniques have been proposed in the recent years for 2D or 3D objects. We present a survey of the different approaches in 3D giving a special attention to the user interface. We show how the approaches are intimately related to the object representations. We conclude by sketching some morphing strategies for the future. Key Words: metamorphosis, shape transformation, interpolation, computer animation, geometric modeling. 1 Introduction Shape interpolation is the process of transforming one shape into another. A metamorphosis or a (3D) morphing of 3D graphical objects [GCDV96] includes the interpolation of their shapes as well as an interpolation of th...

### Citations

357 |
Feature-based image metamorphosis
- Beier, Neely
- 1992
(Show Context)
Citation Context ...tion to the interpolation problem is obtained by linearly interpolating the source and target elevation maps. In the case of image morphing more effective techniques were developed by Beier and Nelly =-=[BN92]-=- or Lee et al. [LCHS94, LCSW95]. These techniques include the use of a warp between the two map domains in order to match features such as ridges or peaks. One can note the resemblance between such te... |

132 | Interactive texture mapping - Maillot, Yahia, et al. - 1993 |

132 | A physically based approach to 2-d shape blending - Sederberg, Greenwood - 1992 |

128 |
Shape transformation for polyhedral objects
- Kent, Carlson, et al.
- 1992
(Show Context)
Citation Context ...(see Fig. 4.). This is accomplished by projecting and further merging each object mesh onto a sphere. Object representation: The technique applies to star-shaped polyhedra. It was further extended in =-=[KPC92]-=- to other classes of objects that can be easily projected onto a sphere. Interaction: The user interface is reduced to the selection of a center point inside each polyhedron and to the selection of th... |

98 | Three-dimensional distance field metamorphosis
- Cohen-or, Levin, et al.
- 1998
(Show Context)
Citation Context ...its characteristic function with value one at the object voxels and zero elsewhere. One can also interpret a voxelized object as the zero level set of the discrete distance to the object voxels as in =-=[COLS98]-=-. If an object is defined by the set of points p such that f(p) = c for some function f and level c, it is easy to define the interior of this object by considering all the points p such that f(p)sc. ... |

92 | Efficently Computing and Representing Aspect Graphs of Polyhedral Objects - Gigus, Canny, et al. - 1991 |

92 | 2d shape blending: An intrinsic solution to the vertex path problem - Sederberg, Gao, et al. - 1993 |

89 | Feature-based volume metamorphosis
- Lerios, Garfinkle, et al.
- 1995
(Show Context)
Citation Context ...rp between the two map domains in order to match features such as ridges or peaks. One can note the resemblance between such techniques and some volume based techniques described above. Lerios et al. =-=[LGL95]-=- have developed a 3D morphing techniques which is in essence strictly equivalent to the image morphing proposed by Beier and Nelly [BN92]. This similarity is due to the fact that an object expressed a... |

86 |
Scheduled fourier volume morphing
- Hughes
- 1992
(Show Context)
Citation Context ...0 t (p)) + tf 1 (B 1 t (p)) = (1 \Gamma t)c 0 + tc 1 : Other techniques are based on a decomposition of the object functions over some functional space basis. Hughes considers a Fourier decomposition =-=[Hug92]-=- and He et al. decompose the functions with a wavelet transform [HWK94]. The coefficients of the decomposition are interpolated in order to define the coefficients of the interpolated object function.... |

86 | Solid-interpolating deformations: construction and animation - Kaul, Rossignac - 1992 |

81 | Computing exact aspect graphs or curved objects: parametric surfaces - Ponce, Kriegman - 1987 |

80 |
Surface coding based on morse theory
- Shinagawa, Kergosien, et al.
- 1991
(Show Context)
Citation Context ...ients. As mentioned above Delingette et al. get round this difficulty by forcing the parameters to change through a physical simulation rather than expressing that change explicitly. Shinagawa et al. =-=[SKK91]-=- propose to encode the shape of an object by means of a graph. This graph called the Reeb graph is constructed from the level sets of a numerical function defined over the surface of the object. Lazar... |

74 | Image metamorphosis using snakes and free-form deformations - Lee, Chwa, et al. - 1995 |

72 | Wavelet-based volume morphing
- He, Wang, et al.
(Show Context)
Citation Context ... are based on a decomposition of the object functions over some functional space basis. Hughes considers a Fourier decomposition [Hug92] and He et al. decompose the functions with a wavelet transform =-=[HWK94]-=-. The coefficients of the decomposition are interpolated in order to define the coefficients of the interpolated object function. The interpolated object function is further recomposed using these coe... |

70 | Shape blending using the starskeleton representation - Shapira, Rappoport - 1995 |

38 | Polygon morphing using a multiresolution representation - Goldstein, Gotsman - 1995 |

32 |
Space deformation models survey
- Bechmann
- 1994
(Show Context)
Citation Context ...bjects are made of clay and transform (approximately) the source object into the target object with modeling and sculpting tools such as FFD and EFFD (see the survey of Bechmann on deformation tools (=-=[Bec94]). The mai-=-n difficulty with this approach is to combine all the successive deformations performed by the user into a single continuous transformation. The risk is indeed to obtain a "piecewise " trans... |

29 | Topological evolution of surfaces
- DeCarlo, Gallier
- 1996
(Show Context)
Citation Context ...mmon mesh for the source and target object implies that they have the same (global) topology. This forbid the transformation of a sphere into a torus. To get round this constraint DeCarlo and Gallier =-=[DG96]-=- propose to use degenerate geometric instantiations of the common mesh where an edge or a face can be embedded onto a single point or edge. Once the correspondence is established, most of the papers u... |

23 |
Shape averaging and its applications to industrial design
- Chen, Parent
- 1989
(Show Context)
Citation Context ...cy relationship is required. Interaction: The method is entirely automatic. Comments: The method seems to only work when the two shapes are similar. No timing is reported. The work of Chen and Parent =-=[CP89]-=- Description: Chen and Parent define a shape averaging based on planar contour interpolations. The shapes are supposed to be sliced into planar contours so that the averaging of two shapes reduces to ... |

22 | Polymorph: Morphing Among Multiple Images - Lee - 1998 |

21 |
Establishing Correspondences by Topological Merging: A New Approach to 3-D Shape Transformation", Graphics Interface '91
- Kent, Parent, et al.
- 1992
(Show Context)
Citation Context ...cal minima. The method look otherwise attractive but few details are provided in the paper. The work of Lazarus and Verroust [LV94, LV97] Description: Lazarus and Verroust extend Kent et al.'s method =-=[KPC91]-=- for cylinder-like objects (see Fig. 5). Given a 3D curve inside each object, two cylindrical meshes are built to approximate the two objects, taking into account their salient features. The metamorph... |

20 | 3D geometric metamorphosis based on harmonic maps
- Kanai, Suzuki, et al.
- 1997
(Show Context)
Citation Context ... method is not intrinsic to the object geometry as opposed to what is claimed by the authors. This is how12 ever one of the few methods that tackle the interpolation problem. The work of Kanai et al. =-=[KHSK98]-=- Description: Kanai et al. present an automatic correspondence method between two polyhedral meshes. Each mesh is first embedded in a planar unit disk using harmonic maps. The correspondence is establ... |

19 |
Matching and interpolation of shapes using unions of circles
- Ranjan, Fournier
- 1996
(Show Context)
Citation Context ...wing equation: (1 \Gamma t)f 0 (p) + tf 1 (p) = (1 \Gamma t)c 0 + tc 1 : Pasko and Savchenko [PS95] precisely use this formulation for the interpolation. Of course, as recalled by Ranjan and Fournier =-=[RF96]-=-, one expects some nice conservative properties during the morph sequence. These properties include no unnecessary distortions or change in topology such as the creation of many connected components. ... |

19 |
Image Morphing: A Survey. The Visual Computer
- Wolberg
- 1998
(Show Context)
Citation Context ...d on a volumetric representation of the objects. Note that we do not address the image morphing problem (see [BN92, LCHS94, LCSW95, RF96, GS98, LWS98, TF98] on that subject and a survey of G. Wolberg =-=[Wol98]-=-). The work of Wyvill [WBB + 90, BBB + 97] Description: Wyvill presents a metamorphosis technique for soft objects whose skeletal elements are composed of points, lines, circles and polygons. Skeleton... |

18 | Polyhedron Realization for Shape Transformation - Shapiro, Tal - 1998 |

16 | Image Morphing Using Deformable Surfaces - Lee - 1994 |

16 | Feature-based shape transformation for polyhedral objects - LAZARUS, A - 1994 |

15 | Contour blending using warp-guided distance field interpolation - Cohen-Or, Levin, et al. - 1996 |

14 |
Shape distortion in computerassisted keyframe animation
- Bethel, Uselton
(Show Context)
Citation Context ...nts: This is one of the first paper on 3D morphing. It is based on several heuristics for handling non convex polygons or cross-sections composed of more than one loop. The work of Bethel and Uselton =-=[BU89]-=- Description: Bethel and Uselton define a morph between two object meshes. They build a super mesh such that by collapsing edges or faces it can be reduced to either of the two input meshes. The super... |

13 |
Blob metamorphosis based on Minkowski sums
- Galin, Akkouche
- 1996
(Show Context)
Citation Context ...rol over the transformation. It takes time O(n k ) for computing a transformation between k polyhedra of size n with the B'ezier formulation. Note that the complexity of the algorithm was improved by =-=[GA96a]-=-. Volume based approaches sampled data implicit functions other signal approach warp + interpolation direct interpolation skeleton based Hug92, HWK94 distance field color interpolation COLS96 LGL95 PS... |

13 | A general algorithm for 3-D shape interpolation in a facet-based representation
- Hong, Magnemat-Thalmann, et al.
- 1988
(Show Context)
Citation Context ... objects is the natural extension of the 2D approach for contours. Again we concentrate on 3D techniques. The reader is referred to [SG92, SGWM93, SR95, GG95] for the 2D case. The work of Hong et al. =-=[HMTT88]-=- Description: Hong et al. propose a correspondence method for objects represented by facets that minimizes the distance of the corresponding facets centroids. The faces of the interpolated objects cor... |

8 | Simplex based animation
- Delingette, Watanabe, et al.
- 1993
(Show Context)
Citation Context ...s converted into a set of intrinsic parameters independent of the coordinate system. Sun et al.[SWC97] attempt to construct objects by interpolating their intrinsic parameters while Delingette et al. =-=[DWS93]-=- simulate a physical animation where the forces are related to a certain distance between the intrinsic parameters of the input objects. The later approach seems more realist as it is not obvious (whe... |

8 |
Metamorphosis of Cylinder-Like Objects
- Lazarus, Verroust
- 1997
(Show Context)
Citation Context ...wo geometric instantiations: one for each source and target object. This single mesh can be obtained by merging the two object meshes as in [BU89, KPC91, KPC92] or by creating a new common mesh as in =-=[LV97]-=-. The correspondence problem remains a difficult step and some authors [HMTT88, BU89, CP89, Par92, DG96, KHSK98, ST98] focus on the correspondence problem independently of the interpolation. According... |

6 | Warp-guided object-space morphing. The Visual Computer - Carmel, Cohen-Or - 1997 |

4 |
Homotopic shape deformation
- Fujimura, Makarov
- 1997
(Show Context)
Citation Context ... projected meshes. Global deformations include rotations of the unit disk or the unit sphere. Local deformations include dragging feature points and can be implemented with the technique described in =-=[FM97]-=-. The aim is to map features from the two input meshes. To help the user in this task we could imagine that picking a point with the mouse on a projected mesh cause the highlight of the corresponding ... |

4 |
Shape Constrained Blob Metamorphosis
- Galin, Akkouche
- 1996
(Show Context)
Citation Context ...a couple scalar values that define the potential functions around the skeleton. In order to interpolate such functions it is more relevant to directly interpolate their parameters. Galin and Akkouche =-=[GA96b]-=- have used Minkowski sums in order to interpolate the skeletons. Note, however, that the interpolation of complex skeletons can lead to another difficult (skeleton) morphing problem. 2.2 Approaches ba... |

4 | Graphical objects
- Gomes, Costa, et al.
- 1996
(Show Context)
Citation Context ...rpolation, computer animation, geometric modeling. 1 Introduction Shape interpolation is the process of transforming one shape into another. A metamorphosis or a (3D) morphing of 3D graphical objects =-=[GCDV96]-=- includes the interpolation of their shapes as well as an interpolation of their attributes. Objects attributes include color, textures or normal fields. Note that an object with attributes can be con... |

4 | Sederberg, A work minimization approach to image morphing, The Visual Computer - Gao, Thomas - 1998 |

3 | Introduction to Implicit Surfaces, chapter 1, 7, 9. Computer Graphics and Geometric Modeling - Bloomenthal, Bajaj, et al. - 1997 |

3 |
transformation by boundary representation interpolation: a recursive approach to establishing face correspondences. The Journal of Visualization and Computer Animation, 3:219--239
- Shape
- 1992
(Show Context)
Citation Context ...rojected meshes. The approach is simple and perform very well for star-shaped polyhedra. t Figure 4: Radial interpolation (in 2D) between a square and a triangle (Kent et al. 1991) The work of Parent =-=[Par92]-=- Description: Parent uses a recursive process to build a common mesh subdivision: the user breaks each polyhedron into two sheets, tracing a closed path of edges on the surface of the polyhedron. Each... |

3 |
A.: AGRELS and BIBs: metamorphosis as a Bézier curve in the space of polyhedra
- Rossignac, Kaul
- 1994
(Show Context)
Citation Context ... 90, BBB + 97], a correspondence between skeletal elements is first established. Interpolated shapes are expressed as soft objects whose skeletal elements are interpolated using Minkowski sums. As in =-=[RK94]-=- the use of Minkowski sums between two polyhedral skeletons is extended to B'ezier transformation for a set of skeletons and the metamorphosis is extended to a blending between a set of soft objects. ... |

3 | Image Interpolation Using Unions of Spheres . The Visual Computer 14 - Tam, Fournier - 1998 |

2 |
D'ecomposition cylindrique de poly`edre et courbe squelette. Revue Internationale de CFAO et d'Infographie
- Lazarus, Verroust
- 1996
(Show Context)
Citation Context ...osis between the two objects is performed on these cylindrical meshes. It consists in an interpolation of the two 3D curves composed with a radial interpolation of each sampling point of the mesh. In =-=[LV96]-=- the authors propose an algorithm for computing an axis inside a polyhedral shape. Object representation: The method is devoted to polyhedra that are star-shaped around an axis. Interaction: The user ... |

1 |
Fusion of 3D shapes
- Decaudin, Gagalowicz
- 1994
(Show Context)
Citation Context ...ation is processed at interactive time. Weak point: determining whether an object is star shaped around an axis and finding such an axis can be a non trivial task. The work of Decaudin and Gagalowicz =-=[DG94]-=- Description: Decaudin and Gagalowicz compose two inter-penetrating shapes by creating a new shape including them with a volume equal to the sum of their volume. The metamorphosis between two star sha... |

1 |
Constructing functionnallydefined surfaces
- Pasko, Savchenko
- 1995
(Show Context)
Citation Context ...et object is given by f 1 (p) = c 1 , we can define an interpolated object for each t 2 [0; 1] by the following equation: (1 \Gamma t)f 0 (p) + tf 1 (p) = (1 \Gamma t)c 0 + tc 1 : Pasko and Savchenko =-=[PS95]-=- precisely use this formulation for the interpolation. Of course, as recalled by Ranjan and Fournier [RF96], one expects some nice conservative properties during the morph sequence. These properties i... |

1 |
Interpolating polyhedral models using intrisic shape parameters
- Sun, Wang, et al.
- 1997
(Show Context)
Citation Context ...s to compute the in-between shapes. A specific model is introduced in some papers: Delingette et al. [DWS93] use a physically-based algorithm to interpolate intrinsic geometric parameters, Sun et al. =-=[SWC97]-=- also interpolate intrinsic geometric parameters using a propagation paradigm, for restricted classes of shapes the interpolation problem is solved jointly with the correspondence problem in [KPC91, K... |