Date: Fri, 27 Dec 1996 10:24:01 +0100 (MET)
Message-Id: <1.5.4.16.19961227102419.2bc7ab06@freenet.hut.fi>
Mime-Version: 1.0
Content-Type: text/plain; charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable
To: djgpp AT delorie DOT com
From: Andreas Vernersson <verner AT freenet DOT hut DOT fi>
Subject: Re: Triangle fills
Cc: T DOT Harte AT btinternet DOT com

At 20:42 1996-12-26 GMT, "Thomas Harte" <T DOT Harte AT btinternet DOT com> wrote:
>	I need to do triangle fills VERY quickly as part of a 3D engine...
>..or preferably which algorithms should I use, to do super fast triangle=20
>fills to either a virtual buffer or to a page other than the one being=20
>displayed on a video card (obviously I would then also need page flipping=
=20
>abilities)?

If you make your own you'll probably got a faster filler than one in a lib.
The fastest algorithm i know of is to scanconverting the edges of the=
 triangle,=20
i.e. find the rightmost and leftmost edge on the triangle for each scanline,=
=20
and then fill the space between..

/andreas vernersson - ume=E5,sweden - hubb AT freenet DOT hut DOT fi - IRC: hubble