3D metamorphosis requires that one 3D model smoothly assume the shape of another 3D model; thus, 3D morphing techniques generate a shape transformation between two models having a different number of vertices and/or a different edge and face network.
Digital Fluere is a 3D metamorphosis algorithm discovered and developed by Sahin Kupusoglu as his Bogazici University Computer Engineering Thesis in 1994, under contributing supervision of Dr. Selahattin Kuru and Dr. Ergun Akleman. Digital Fluere has its roots at the physically-based methods described at [KENT 92]. It can be considered to be an enhancement of the surrounded region technique of the cited reference.
Digital Fluere first creates barycentric maps of the input models by placing all vertices into a triangle and running a simulation that treats the edges as tensioned springs. Then by topological merging of these maps, it computes a new meta-model that can assume the shape of both input models. Input models are required to have a continuous surface without degenerate elements or holes, and thus satisfy Euler's graph planarity formula:
V + F = E + 2
where V, E, and F are the number of vertices, edges and faces of the model. Such models are called “Euler valid, Genus 0” models. As can be seen from the below animation, Digital Fluere can process conforming concave models.
 |
 |
 |
For the sample morph sequence between a 4 triangle tetrahedron and a 204 triangle knotting glass, Digital Fluere computed a 416 triangle meta-model that can assume the shape of both models. All modeling and rendering were done using my own custom software.
[References]
[KENT 92] Kent, J.R., Carlson, W.E. and Parent, R.E. Shape Transformation for Polyhedral Objects, SIGGRAPH '92 Computer Graphics, 47 - 54.
[WATT 92] Watt, A. and Watt, M. Advanced Animation and Rendering Techniques - Theory and Practice, Addison - Wesley, ACM Press, 1992.
This page: http://kupusoglu.com/fluere.aspx Last updated: 2008 Jan 23 | ♥ 1 146 |
|
|
DISCLAIMER: By browsing or using or downloading from or uploading or linking to this web site, you agree to all of the terms of this web site's ↑license agreement.
