Path: utzoo!mnetor!uunet!husc6!bloom-beacon!oberon!cit-vax!ucla-cs!lanai!trainor
From: trainor@lanai.cs.ucla.edu (Vulture of Light)
Newsgroups: comp.graphics
Subject: Re: Mapping algorithm question - NOT cartograpy
Message-ID: <11097@shemp.CS.UCLA.EDU>
Date: 10 Apr 88 06:38:36 GMT
References: <844@agora.UUCP>
Sender: news@CS.UCLA.EDU
Reply-To: trainor@lanai.UUCP (Vulture of Light)
Organization: UCLA Computer Science Department
Lines: 18
Keywords: 2d mapping

In article <844@agora.UUCP> rickc@agora.UUCP (Rick Coates) writes:
>A new question:  I am interested in mapping one 2d area into another.
>The first area may be rectangular, the second a collection of vectors
>with four points defined as corresponding to the original rectangle's.
>[...]
>I realize that this problem is not completely defined - behavior in
>in extreme cases may be odd.  I am interested in any and all input.

It sounds ill-posed, but maybe this will help:  It is straightforward
to transform any triangle to any other triangle*.  In 2-d this can be
done by a 3x3 matrix tranformation.  By triangulating your regions in
some standard way you may be able to achieve something like you want.

--------
* For beginners, if you don't understand this, think of it as two
  concatenated transformations.  The first transform takes the firsti
  triangle to a lanonical triangle (say with vertices (0,0) (1,0) (0,1) ), 
  and then transform that to your your second triangle.