moran@p.cs.uiuc.edu (04/07/90)
>Written 11:25 pm Apr 4, 1990 by jcs@crash.cts.com > The method I use in my realtime simulator is probably the simplest- >build a minx/maxx table by using a bresenham type algorithm to compute >the minx/maxx for each scanline for each line segment. Then scan convert ... > John This method is indeed fast, but the polygons must be convex. If they aren't the algorithm will draw them as if they were. I know there's a pascal example using GKS calls for polygon fill in the text "Computer Graphics" by Donald Hearn. The algorithm keeps a sorted edge list and can fill scan line by scan line. Pat Moran moran@cs.uiuc.edu