A "stick figure" is a connected straight-line plane graph, some-times 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 al-gorithms for morphing compatible planar polygons using Steiner vertices, and improves the complexity of those algorithms by re-ducing the number of Steiner vertices used.