An intuitive polygon morphing
We present a new algorithm for morphing simple polygons that is inspired by growing forms in nature. While previous algorithms require user-assisted definition of complicated correspondences between the morphing objects, our algorithm defines the correspondence by overlapping the input polygons. Once the morphing of one object into another is defined, very little or no user interaction is necessary to achieve intuitive results. Our algorithm is suitable namely for growth-like morphing. We present the basic algorithm and its three variations. One of them is suitable mainly for convex polygons, the other two are for more complex polygons, such as curved or spiral polygonal forms.
KeywordsMorphing Vector data Polygon intersection Computer Graphics
Unable to display preview. Download preview PDF.
Below is the link to the electronic supplementary material. (228 kB)
- 2.Alexa, M., Cohen-Or, D., Levin, D.: As-rigid-as-possible shape interpolation. In: Proceedings of SIGGRAPH 2000, pp. 157–164 (2000) Google Scholar
- 4.Comninos, P.: Mathematical and Computer Programming Techniques for Computer Graphics. Springer, Berlin (2006) Google Scholar
- 5.Gomes, J., Darsa, L., Costa, B., Velho, L.: Warping and Morphing of Graphical Objects. Morgan Kaufmann, San Mateo (1999) Google Scholar
- 6.Johnstone, J.K., Wu, X.: Morphing two polygons into one. In: The 40th Annual Southeast ACM Conference (2002) Google Scholar
- 8.Málková, M.: Core-based morphing algorithm for triangle meshes. In: SIGRAD 2008, vol. 34, pp. 39–46 (2008) Google Scholar