Title :
Morphing stick figures using optimized compatible triangulations
Author :
Surazhsky, Vitaly ; Gotsman, Craig
Author_Institution :
Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
Abstract :
A "stick figure" is a connected straight-line plane graph, sometimes called a "skeleton". Compatible stick figures are those with the same topological structure. We present a method for naturally morphing between two compatible stick figures in a manner that preserves compatibility throughout the morph. In particular, this guarantees that the intermediate shapes are also stick figures (e.g. they do not self-intersect). Our method generalizes existing algorithms for morphing compatible planar polygons using Steiner vertices, and improves the complexity of those algorithms by reducing the number of Steiner vertices used
Keywords :
computational complexity; computational geometry; computer animation; image morphing; optimisation; topology; Steiner vertices; compatible planar polygons; compatible stick figures; complexity; connected straight-line plane graph; intermediate shapes; morphing stick figures; optimized compatible triangulations; skeleton; topological structure; Animation; Cities and towns; Computer graphics; Computer science; Shape; Trajectory;
Conference_Titel :
Computer Graphics and Applications, 2001. Proceedings. Ninth Pacific Conference on
Conference_Location :
Tokyo
Print_ISBN :
0-7695-1227-5
DOI :
10.1109/PCCGA.2001.962856