Refolding Planar Polygons

This paper describes an algorithm for generating a guaranteed intersection-free interpolation sequence between any pair of compatible polygons. Our algorithm builds on prior results from linkage unfolding, and if desired it can ensure that every edge length changes monotonically over the course of the interpolation sequence. The computational machinery that ensures against self-intersection is independent from a distance metric that determines the overall character of the interpolation sequence. This decoupled approach provides a powerful control mechanism for determining how the interpolation should appear, while still assuring against intersection and guaranteeing termination of the algorithm. Our algorithm also allows additional control by accommodating a set of algebraic constraints that can be weakly enforced throughout the interpolation sequence.

[1]  Jarek Rossignac,et al.  Solid-interpolating deformations: Construction and animation of PIPs , 1991, Comput. Graph..

[2]  Craig Gotsman,et al.  Controllable morphing of compatible planar triangulations , 2001, TOGS.

[3]  James F. O'Brien,et al.  Shape transformation using variational implicit functions , 1999, SIGGRAPH 1999.

[4]  Daniel Cohen-Or,et al.  Three-dimensional distance field metamorphosis , 1998, TOGS.

[5]  John F. Hughes,et al.  Scheduled Fourier volume morphing , 1992, SIGGRAPH.

[6]  Ileana Streinu,et al.  A combinatorial approach to planar non-colliding robot arm motion planning , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[7]  Kendall E. Atkinson.  An introduction to numerical analysis , 1978 .

[8]  Ari Rappoport,et al.  Shape blending using the star-skeleton representation , 1995, IEEE Computer Graphics and Applications.

[9]  Thomas W. Sederberg,et al.  A physically based approach to 2–D shape blending , 1992, SIGGRAPH.

[10]  Marc Alexa,et al.  As-rigid-as-possible shape interpolation , 2000, SIGGRAPH.

[11]  John E. Dennis,et al.  Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[12]  Günter Rote,et al.  Blowing Up Polygonal Linkages , 2003 .

[13]  Begnaud Francis Hildebrand,et al.  Introduction to numerical analysis: 2nd edition , 1987 .

[14]  Leonidas J. Guibas,et al.  Morphing Simple Polygons , 1994, SCG '94.

[15]  W SederbergThomas,et al.  A physically based approach to 2D shape blending , 1992 .

[16]  Arie E. Kaufman,et al.  Wavelet-based volume morphing , 1994, Proceedings Visualization '94.

[17]  Erik D. Demaine,et al.  An energy-driven approach to linkage unfolding , 2004, SCG '04.

[18]  J. Baumgarte.  Stabilization of constraints and integrals of motion in dynamical systems , 1972 .

[19]  William H. Press,et al.  Numerical recipes in C , 2002 .

[20]  Peisheng Gao,et al.  2-D shape blending: an intrinsic solution to the vertex path problem , 1993, SIGGRAPH.

[21]  William H. Press,et al.  Numerical Recipes in C, 2nd Edition , 1992 .

[22]  Craig Gotsman,et al.  Polygon morphing using a multiresolution representation , 1995 .

[23]  Erik D. Demaine,et al.  Reconfiguring convex polygons , 2001, Comput. Geom..

[24]  Craig Gotsman,et al.  Intrinsic Morphing of Compatible Triangulations , 2003, Int. J. Shape Model..

[25]  Leonidas J. Guibas,et al.  Morphing between polylines , 2001, SODA '01.

[26]  Craig Gotsman,et al.  Guaranteed intersection-free polygon morphing , 2001, Comput. Graph..

[27]  Daniel Cohen-Or,et al.  Warp-guided object-space morphing , 1998, The Visual Computer.

[28]  Günter Rote,et al.  Straightening polygonal arcs and convexifying polygonal cycles , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.