Jump to content

Beier–Neely morphing algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 24.90.73.84 (talk) at 20:54, 3 March 2013. 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 start-points and end-points 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
Stub icon

This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Beier–Neely_morphing_algorithm&oldid=541942159"