Jump to content

Beier–Neely morphing algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 99.237.88.223 (talk) at 04:16, 21 December 2012. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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

  1. ^ Beier, T. & Neely, S. (1992) Feature-based image metamorphosis, Computer Graphics, 26(2), 35-42