From: utzoo!utcsrgv!elf
Newsgroups: net.micro,net.graphics
Title: Re: area flooding
Article-I.D.: utcsrgv.1304
Posted: Tue Apr 19 11:50:27 1983
Received: Tue Apr 19 15:12:01 1983
References: utcsrgv.1299

Uhmm, I beg to differ, but a true "polygon fill" algorithm is no harder
than the (more general) area fill algorithm, since the former is easily
reduced to the latter.  Given a list of polygon vertices which are traversed
in a standard way (e.g. clockwise, so the inside is to the right), I can
use an area fill algorithm to fill in the polygon by first writing
8-connected lines between the vertices (by using Bresenham's algm, for
instance), determining one interior point (easy), and applying area fill.

An easier polygon fill is to use a Watkin's-like scan-out, which can
probably be done *faster* than an area fill in practice because no pixels
have to be read back.

Eugene Fium
Oops, that's Fiume
U of Tarana
utcsrgv!elf