Morphing Three Dimensional Polyhedral Objects
Oberlin College Honors Paper
Carl Erikson

This paper describes an algorithm which tries to find the best correspondence
solution between two three dimensional polyhedra resulting in the most visually
pleasing transformation.  It treats morphing as a bending of a wireframe
polyhedra and it tries to find the transformation which requires the least
amount of bending and stretching of this wireframe.

Oberlin College
Department of Computer Science
Oberlin, OH  44074