“Refolding planar polygons”
Conference:
Type:
Title:
- Refolding planar polygons
Presenter(s)/Author(s):
Abstract:
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 char- acter of the interpolation sequence. Additional control is provided to the user through specifying algebraic constraints that can be enforced throughout the sequence.
References:
Cantarella, J. H., Demaine, E. D., Iben, H. N., and O’Brien, J. F. 2004. An energy-driven approach to linkage unfolding. In The 2004 Symposium on Computational Geometry. To appear.
