🚀 go-pugleaf

I need a rotation algorithm that will allow me to rotate the contents of
a bounding rectangle at a given angle. Currently, I am using the standard
algorithm of rotating the point around the origin with
	[ cosX -sinX ][ x ]
	[ sinX  cosX ][ y ]
but this causes the resultant image to have "holes" in it if I am rotating
a filled image (with black). Each set pixel in the bounding rectangle is
rotated in this fashion and is very tedious as each row of pixels has to 
be scanned. I know that this is a very slow method but I am currently stuck
with it for want of a better method.

The free rotation method used in SuperPaint does not have this problem and
I would like to know how those guys did it.

I am using the rotation as part of an Honours Project application in visual
recognition and would appreciate it greatly if somebody could mail me a
better algorithm. If there is anyone else who would be interested in such
an algorithm, I will post the suggested algorithms on the news.

Thanks in advance.

J.T. Teh
===========================
UUCP:	{seismo,mcvax,ukc,ubc-vision}!mulga!jteh
ARPA:	jteh%mulga.oz@seismo.css.gov
CSNET:	jteh%mulga.oz@australia