Path: utzoo!attcan!uunet!samsung!brutus.cs.uiuc.edu!ux1.cso.uiuc.edu!ux1.cso.uiuc.edu!m.cs.uiuc.edu!p.cs.uiuc.edu!moran
From: moran@p.cs.uiuc.edu
Newsgroups: comp.graphics
Subject: Re: polygon fills
Message-ID: <77100015@p.cs.uiuc.edu>
Date: 7 Apr 90 16:38:26 GMT
References: <212121@<1990Apr4>
Lines: 19
Nf-ID: #R:<1990Apr4:212121:p.cs.uiuc.edu:77100015:000:631
Nf-From: p.cs.uiuc.edu!moran    Apr  6 10:57:00 1990



>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