Refolding Planar Polygons

This sketch describes a guaranteed technique for generating intersection-free interpolation sequences between arbitrary, non-intersecting, planar polygons. The computational machinery that ensures against self intersection guides a user-supplied distance heuristic that determines the overall character of the interpolation sequence. Additional control is provided to the user through specifying algebraic constraints that can be enforced throughout the sequence.