A physically based approach to 2–D shape blending
- 1 July 1992
- journal article
- conference paper
- Published by Association for Computing Machinery (ACM) in ACM SIGGRAPH Computer Graphics
- Vol. 26 (2), 25-34
- https://doi.org/10.1145/142920.134001
Abstract
This paper presents a new afgorithm for smoothly blending between two 2-D polygonal shapes. The algorithm is based on a physical model wherein one of the shapes is considered to be constructed of wire, and a solution is found whereby the first shape can be bent and/or stretched into the second shape with a minimum amount of work. The resulting solution tends to associate regions on the two shapes which look alike. If the two polYgons have m and n vertices respectively, the afgorithm is O(mn). The algorithm avoids local shape inversions in whkh intermediate polygons self-intersect, if such a solution exists.Keywords
This publication has 9 references indexed in Scilit:
- Automatic shape model acquisition using multiscale segment matchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Shape averaging and its applications to industrial designIEEE Computer Graphics and Applications, 1989
- Graphical search and replaceACM SIGGRAPH Computer Graphics, 1988
- Snakes: Active contour modelsInternational Journal of Computer Vision, 1988
- A new general triangulation method for planar contoursPublished by Association for Computing Machinery (ACM) ,1982
- The problems of computer-assisted animationACM SIGGRAPH Computer Graphics, 1978
- Conversion of complex contour line definitions into polygonal element mosaicsPublished by Association for Computing Machinery (ACM) ,1978
- Optimal surface reconstruction from planar contoursCommunications of the ACM, 1977
- Approximating Complex Surfaces by Triangulation of Contour LinesIBM Journal of Research and Development, 1975