|Author:||Ho, Yuen-hin Kelvin|
|Title:||A software tool for the design of three dimensional morphing sequences|
|Subject:||Morphing (Computer animation)|
Hong Kong Polytechnic University -- Dissertations
Department of Computing
|Pages:||iv, 287 leaves : ill. (chiefly col.) ; 30 cm|
|Abstract:||Morphing process continuously transforms one object to another. The morphing sequence is the ultimate product of a morphing algorithm. In general, the morphing algorithms proposed in the literature just aim at providing a small amount of possible morphing sequences with benefits such as better shape deformation characteristics or works minimization. This may limit the possibility of creating variations in morphing sequence and therefore hinder artists' creativity. On the contrary, in this dissertation, we propose a new morphing algorithm, which aims at generating a huge amount of possible morphing sequences. The key concept underlying this work is the application of an evolutionary algorithm to the morphing issue. Each intermediate object is taken as an offspring of two parent objects, which are taken as the source and target objects. A software tool is developed based on this concept. It was demonstrated that this tool could generate a variety of morphing sequences.|
Files in This Item:
|b15321484.pdf||For All Users (off-campus access for PolyU Staff & Students only)||14.26 MB||Adobe PDF||View/Open|
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item: