| | This Article | |
| |
| |
| | Share | |
| |
| |
| | Bibliographic References | |
| |
| |
| | Add to: | |
| |
 Digg
 Furl
 Spurl
 Blink
 Simpy
 Google
 Del.icio.us
 Y!MyWeb
| |
| | Search | |
| |
| |
| | |
Metamorphosis of 3D Polyhedral Models Using Progressive Connectivity Transformations
January/February 2005 (vol. 11 no. 1)
pp. 2-12
Three-dimensional metamorphosis is a powerful technique to produce a 3D shape transformation between two or more existing models. In this paper, we propose a novel 3D morphing technique that avoids creating a merged embedding that contains the faces, edges, and vertices of two given embeddings. This novel 3D morphing technique dynamically adds or removes vertices to gradually transform the connectivity of 3D polyhedrons from a source model into a target model and simultaneously creates the intermediate shapes. In addition, a priority control function provides the animators with control of arising or dissolving of input models' features in a morphing sequence. This is a useful tool to control a morphing sequence more easily and flexibly. Several examples of aesthetically pleasing morphs are demonstrated using the proposed method.
[1] 2 F. Lazarus and A. Verroust, “Three-Dimensional Metamorphosis: A Survey,” The Visual Computer, vol. 14, pp. 373-389, 1998.[2] M. Alexa, “Mesh Morphing,” STAR: State of The Art Report, EUROGRAPHICS, 2001.[3] A. Lerious, C.D. Garfinkle, M. Levoy, “Feature-Based Volume Metamorphosis,” ACM SIGGRAPH Conf. Proc., pp. 449-456, 1995.[4] D. Cohen-Or, D. Levin, and A. Solomovici, “Three-Dimensional Distance Field Morphing,“ ACM Trans. Graphics, vol. 17, no. 2, pp. 116-141, 1998.[5] A. Gregory, A. State, M. Lin, D. Manocha, and M. Livingston, “ Interactive Surface Decomposition for Polyhedra Morphing,” The Visual Computer, vol. 15, no. 9, pp. 453-470, 1999.[6] M. Zockler, D. Stalling, and H.-C. Hege, “Fast and Intuitive Generation of Geometric Shape Transitions,” The Visual Computer, vol. 16, no. 5, pp. 241-253, 2000.[7] M. Alexa, “Merging Polyhedral Shapes with Scattered Features,” The Visual Computer, vol. 16, no. 1, pp. 26-37, 2000.[8] T.-Y. Lee and P.-H. Hung, “Fast and Intuitive Metamorphosis of 3D Polyhedral Models Using SMCC Mesh Merging Scheme,” IEEE Trans. Visualization and Computer Graphics, vol. 9, no. 1, pp. 85-98, Jan.-Mar. 2003.[9] T. Kanai, H. Suzuki, and F. Kimura, “Three-Dimensional Geometric Metamorphosis Based on Harmonic Maps,” The Visual Computer, vol. 14, pp. 166-176, 1998.[10] T. Kanai, H. Suzuki, and F. Kimura, “Metamorphosis of Arbitrary Triangular Meshes,” IEEE Computer Graphics and Applications, pp. 62-75, 2000.[11] A. Lee, D. Dobkin, W. Sweldens, and P. Schroder, “Multiresolution Mesh Morphing,” ACM SIGGRAPH Conf. Proc., pp. 343-350, 1999.[12] S. Shlafman, A. Tal, and S. Katz, “Metamorphosis of Polyhedral Surfaces Using Decomposition,” EUROGRAPHICS, vol. 21, no. 3, pp. 219-228, 2002.[13] U. Finke and A. Hinrichs, “Overlaying Simply Connected Planar Subdivisions in Linear Time,” Proc. 11th Ann. Sym. Computational Geometry, pp. 119-26, June 1995.[14] M. Alexa, D. Cohen-Or, and D. Levin, “As-Rigid -as-Possible Shape Interpolation,” ACM SIGGRAPH Conf. Proc., pp. 157-164, 2000.[15] T. Michikawa, T. Kanai, M. Fujita, and H. Chiyokura, “Multiresolution Interpolation Meshes,” Proc. Ninth Pacific Graphics Int'l Conf. (Pacific Graphics 2001), pp. 60-69, Oct. 2001.[16] E. Praun, W. Sweldens, and P. Schroder, “Consistent Mesh Parameterization,” ACM SIGGRAPH Conf. Proc., pp. 179-184, 2001.[17] M. Ahn and S. Lee, “Mesh Metamorphosis with Topology Transformation,” Proc. Pacific Graphics 2002, pp. 481-482, Oct. 2002.[18] P. Alliez, M. Meyer, and M. Desbrun, “Interactive Geometry Remeshing,” ACM SIGGRAPH Conf. Proc., pp. 347-354, 2002.[19] I. Eckstein, V. Surazhsky, and C. Gotsman, “Texture Mapping with Hard Constraints,” Computer Graphics Forum, vol. 20, no. 3, pp. 95-104, 2001.[20] V. Kraevoy, A. Sheffer, and C. Gotsman, “Matchmaker: Constructing Constrained Texture Maps,” ACM SIGGRAPH Conf. Proc., pp. 326-333, 2003.[21] H. Hoppe, T. DeRose, T. Dunchamp, J. McDonald, and W. Stuetzle, “Mesh Optimization,” ACM SIGGRAPH Conf. Proc., pp. 19-26, 1993.[22] H. Hoppe, T. DeRose, T. Dunchamp, J. McDonald, and W. Stuetzle, “Mesh Optimization,” Technical Report TR 93-01-01, Univ. of Washington, 1993.[23] J.R. Shewchuk, “Updating and Constructing Constrained Delaunay and Constrained Regular Triangulations by Flips,” Proc. Symp. Computational Geometry, pp. 181-190, 2003.[24] R. Seidel, “A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and Triangulating Polygons,” Computational Geometry: Theory and Applications, pp. 51-64, 1991.[25] S. Hanke, T. Ottmann, and S. Schuierer, “The Edge-Flipping Distance of Triangulations,” J. Universal Computer Science, vol. 2, no. 8, pp. 570-579, Aug. 1996.[26] H. Hoppe, “Efficient Implementation of Progressive Meshes,” Computers & Graphics, vol. 22, no. 1, pp. 27-36, 1998.
Index Terms:
Metamorphosis, connectivity fransformation, embedding, scheduling.
Citation:
Chao-Hung Lin, Tong-Yee Lee, "Metamorphosis of 3D Polyhedral Models Using Progressive Connectivity Transformations," IEEE Transactions on Visualization and Computer Graphics, vol. 11, no. 1, pp. 2-12, Jan./Feb. 2005, doi:10.1109/TVCG.2005.12
