1. pixel 'rithmetic
I'm trying to move a bitmap 'into' a point, and since the triangle describing
the move is not right angled, and has no horizontal component, I am at a
loss...
Example:
assuming a point at (75,208), and a bitmap of (101,158) at (279,121);
How might I calculate the location of every pixel co-ordinate along the line
described by ( (75,208) to (279,121) ), AND the vertical distance
TO the bottom line described by ( (75,208) to (279,279) ) ?
Do I have to break this up into 2 triangles,
with each having a horizontal component, ((75,208) to (279,208),
or is there another easier way ?
This might look like 'crap' , moving either left along the top line,
or just moving left along the 'common' line, but I don't even know how to
try these ... 
'math_challenged'_Wolf
wolfritz at king.igs.net
