Development of a graphical user interface for 2D shape morphing

• Main Author: Paulina Konggidinata.
• Other Authors: Zheng Jianmin
• Format: Final Year Project
• Language: English
• Published: 2009
• Subjects: DRNTU::Engineering::Computer science and engineering::Computing methodologies::Computer graphics
• Online Access: http://hdl.handle.net/10356/16922
• Institution: Nanyang Technological University

2D Morphing is a technique of gradually creating a smooth transformation from one shape to another which may be described by 2D curves or polygons. A 2D shape morphing application developed for this project is used as a testbed to transform a source to a target by computing intermediate values between the source and target points based on constraints specified by the user. The project aims to develop a framework for 2D morphing so that it can be efficiently incorporated with the existing 2D morphing algorithms. This framework will be used as a basis platform for experimenting and testing 2D morphing. In addition, this project also empowers user with the capability to conveniently and effectively control the whole morphing process. The focus of this project is to provide a more intuitive and user friendly GUI. In this project, 2D shape blending techniques which had been developed in Java were used as references to get a better understanding on how the morphing techniques perform. 2D shape morphing methods typically perform transformation in five stages from the source to destination shape. In the first step, for the two selected curves as the input to the program, we need to preprocess the raw data: normalize them into a common morphing window. In the second step, point simplification is performed to eliminate the duplicate vertex points of the source and destination polygons. In the third step, we need to establish a vertex correspondence to compute the association between the source and the target shape using a 1-to-1 or 1-to-n vertex correspondence method. In the interpolation step, the user can select vertex interpolation or intrinsic-edge angle interpolation algorithm to generate a reliable transformation from the source to the destination shape. In the last step, we can use the edge-tweaking method or a new method to solve the non-closure problem occurred in intrinsic interpolation algorithm.