Abstract
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.
References
Aichholzer, O., Demaine, E.D., Erickson, J., Hurtado, F., Overmars, M., Soss, M.A., Toussaint, G.T.: Reconfiguring convex polygons. Comput. Geom., Theory Appl. 20(1–2), 85–95 (2001)
Alexa, M., Cohen-Or, D., Levin, D.: As-rigid-as-possible shape interpolation. In: Proceedings of ACM SIGGRAPH 2000, pp. 157–164 (July 2000)
Atkinson, K.E.: An Introduction to Numerical Analysis, 2nd edn. Wiley, New York (1989)
Baumgarte, J.: Stabilization of constraints and integrals of motion in dynamical systems. Comput. Methods Appl. Mech. Eng. 1, 1–16 (1972)
Cantarella, J.H., Demaine, E.D., Iben, H.N., O’Brien, J.F.: An energy-driven approach to linkage unfolding. In: Proceedings of the 20th Annual Symposium on Computational Geometry, pp. 134–143 (June 2004)
Carmel, E., Cohen-Or, D.: Warp-guided object-space morphing. Vis. Comput. 13, 465–478 (1997)
Cohen-Or, D., Solomovic, A., Levin, D.: Three-dimensional distance field metamorphosis. ACM Trans. Graph. 17(2), 116–141 (1998)
Connelly, R., Demaine, E.D., Rote, G.: Straightening polygonal arcs and convexifying polygonal cycles. Discrete Comput. Geom. 30(2), 205–239 (2003)
Dennis, J.E., Schnabel, R.B.: Numerical Methods for Unconstrained Optimization and Nonlinear Equations. SIAM, Englewood Cliffs (1996)
Efrat, A., Har-Peled, S., Guibas, L.J., Murali, T.M.: Morphing between polylines. In: Proceedings of the Twelfth ACM-SIAM Symposium on Discrete Algorithms, pp. 680–689 (2001)
Goldstein, E., Gotsman, C.: Polygon morphing using a multiresolution representation. In: Proceedings of Graphics Interface, pp. 247–254 (1995)
Gotsman, C., Surazhsky, V.: Guaranteed intersection-free polygon morphing. Comput. Graph. 25(1), 67–75 (2001)
Guibas, L., Hershberger, J.: Morphing simple polygons. In: Proceedings of the 10th Annual Symposium on Computational Geometry, pp. 267–276 (1994)
He, T., Wang, S., Kaufman, A.: Wavelet-based volume morphing. In Bergeron, D., Kaufman, A. (eds.) Proceedings of Visualization ’94, pp. 85–92 (1994)
Hughes, J.F.: Scheduled Fourier volume morphing. In: Proceedings of ACM SIGGRAPH 1992, pp. 43–46 (1992)
Kaul, A., Rossignac, J.: Solid-interpolating deformations: Construction and animation of PIPs. In: Proceedings of Eurographics ’91, pp. 493–505 (1991)
Press, W.H., Flannery, B.P., Teukolsky, S.A., Vetterling, W.T.: Numerical Recipes in C, 2nd edn. Cambridge University Press, Cambridge (1994)
Sederberg, T.W., Greenwood, E.: A physically based approach to 2-d shape blending. In: Proceedings of ACM SIGGRAPH 1992, pp. 25–34 (July 1992)
Sederberg, T.W., Gao, P., Wang, G., Mu, H.: 2-d shape blending: an intrinsic solution to the vertex path problem. In: Proceedings of ACM SIGGRAPH 1993, pp. 15–18 (August 1993)
Shapira, M., Rappoport, A.: Shape blending using the star-skeleton representation. IEEE Comput. Graph. Appl. 15, 44–50 (1995)
Streinu, I.: A combinatorial approach to planar non-colliding robot arm motion planning. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, California, pp. 443–453 (November 2000)
Surazhsky, V., Gotsman, C.: Controllable morphing of compatible planar triangulations. ACM Trans. Graph. 20(4), 203–231 (2001)
Surazhsky, V., Gotsman, C.: Intrinsic morphing of compatible triangulations. Int. J. Shape Model. 9(2), 191–201 (2003)
Turk, G., O’Brien, J.F.: Shape transformation using variational implicit functions. In: Proceedings of ACM SIGGRAPH 1999, pp. 335–342 (August 1999)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Iben, H.N., O’Brien, J.F. & Demaine, E.D. Refolding Planar Polygons. Discrete Comput Geom 41, 444–460 (2009). https://doi.org/10.1007/s00454-009-9145-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-009-9145-7
Keywords
- Polygon interpolation
- Morphing
- Shape transformation
- Refolding