Beier–Neely morphing algorithm
The Algorithm of Beier and Neely[1] is a method to compute a mapping of coordinates between 2 images from a set of lines whose startpoints and endpoints are given for both images. The Algorithm is widely used within Morphing software.
See also
References
- ^ Beier, T. & Neely, S. (1992) Feature-based image metamorphosis, Computer Graphics, 26(2), 35-42
External links
- Description of the algorithm by Arnold Rosenbloom of the University of Toronto
- Description of the algorithm by Evan Walloc of Bloom University
 | This article has not been added to any content categories. Please help out by adding categories to it so that it can be listed with similar articles, in addition to a stub category. (May 2012) |
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |