Computer Graphics

University of California - Berkeley

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.


Hayley N. Iben, James F. O'Brien, and Eric D. Demaine. "Refolding Planar Polygons". In Proceedings of SIGGRAPH 2004, Technical Sketch, August 2004.

Supplemental Material

Full Paper

The full version of this paper was published in SoCG 2006.