Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.3 4.3bsd-beta 6/6/85; site turtlevax.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!bellcore!decvax!decwrl!turtlevax!ken
From: ken@turtlevax.UUCP (Ken Turkowski)
Newsgroups: net.math,net.graphics
Subject: Re: Looking for 2D point fitting alg's: Rubber Sheet or BiLinear
Message-ID: <1041@turtlevax.UUCP>
Date: Mon, 27-Jan-86 18:35:12 EST
Article-I.D.: turtleva.1041
Posted: Mon Jan 27 18:35:12 1986
Date-Received: Thu, 30-Jan-86 01:04:11 EST
References: <191@octopus.UUCP>
Reply-To: ken@turtlevax.UUCP (Ken Turkowski)
Organization: CIMLINC, Inc. @ Menlo Park, CA
Lines: 19
Xref: watmath net.math:2740 net.graphics:1422

In article <191@octopus.UUCP> pete@octopus.UUCP (Pete Holzmann) writes:
>E.g., I have N sets of (x,y) -> (x',y') values, and want a general way
>to come up with F(x,y) that gives (x',y') for any (x,y).p

How about this:

Let z = (x, y, x', y') and order your N sets of 4-D points (by x and/or
y).  Make up an interpolating polynomial (if N isn't too large) or
spline in t such that all of your data points (z) correspond to some t
in [0,1]:

	z = z(t)

Then solve for the z that minimizes the distance to a selected (x, y)
in the (x, y) plane.
-- 
Ken Turkowski @ CIMLINC, Menlo Park, CA
UUCP: {amd,decwrl,hplabs,seismo,spar}!turtlevax!ken
ARPA: turtlevax!ken@DECWRL.DEC.COM