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 O.mangold (talk | contribs) at 09:58, 14 May 2012 (Initial creation of page). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
Stub icon

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

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
Retrieved from "https://en.wikipedia.org/w/index.php?title=Beier–Neely_morphing_algorithm&oldid=492495028"