Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!ucbvax!ucsd!sdcsvax!ucsdhub!hp-sdd!hplabs!hpfcdc!hpfcdq!benji
From: benji@hpfcdq.HP.COM (Jeff Benjamin)
Newsgroups: comp.graphics
Subject: Looking for simple fill algorithm
Message-ID: <390030@hpfcdq.HP.COM>
Date: 21 Apr 89 19:41:59 GMT
Organization: Hewlett-Packard - Fort Collins, CO
Lines: 17

I'm posting this question for someone who can't do it himself, although
I'm also interested in the answer.  If you email a reply, also send it
to:  mikew@tahoe.unr.edu (Mike Wishart).

Does anyone know if there is a simple algorithm for filling a closed path?
The path may have several loops.
Data structures available: an array of the screen [166x199], a list
containing all the points in the path, or whatever you wish.

This is for a simple PostScript interpreter for CGA or better PC's.

Thanks.

-----
Jeff Benjamin                         {ucbvax,hplabs}!hpfcla!benji
Graphics Technology Division          benji%hpfcla@hplabs.HP.COM
Hewlett Packard Co.                   Fort Collins, Colorado