There's an entertaining account of a real world problem along these lines about the famous "Unicorn Tapestry" in the Cloisters in NYC, solved by the Chudnovsky brothers. Frustratingly, I can't find any published technical work about their algorithm. Victor http://www.cse.buffalo.edu/~rapaport/111F04/capturingTheUnicorn.pdf On Fri, Sep 11, 2015 at 11:43 AM, Warren D Smith <warren.wds@gmail.com> wrote:

Given two images, each consisting of N pixels. We want to find the way to rotate, scale, and translate image #1 so it best matches up with image #2.

I believe I have invented algorithmic ways to do this in O(NlogN) time.

I'm somewhat surprised nobody ever thought of them before. But maybe that is because somebody DID think of them before... QUESTION: did they?

(It also might be because I'm wrong... I'll describe my methods later...)

_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun