Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site ncr-tp.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!allegra!bellcore!decvax!ittvax!dcdwest!sdcsvax!sdcc3!sdcc6!ncr-tp!carl
From: carl@ncr-tp.UUCP (Carl Kuck)
Newsgroups: net.graphics
Subject: Request for simple area-filling algorithm
Message-ID: <169@ncr-tp.UUCP>
Date: Mon, 15-Apr-85 16:42:57 EST
Article-I.D.: ncr-tp.169
Posted: Mon Apr 15 16:42:57 1985
Date-Received: Thu, 18-Apr-85 04:40:16 EST
Expires: Tue, 14-May-85 21:00:00 EST
References: none
Reply-To: carl@ncr-tp.UUCP (Carl Kuck)
Followup-To: net.graphics
Distribution: net
Organization: NCR Corporation, Torrey Pines
Lines: 15
Keywords: bit-map, area fill


   HELP!  Do any of you graphics hackers in netland have (or can you point
me to) a simple (recursive O.K.) algorithm for filling an area defined by
a boundary in a particular bit-plane.  A 1-plane algorithm is O.K., I can
expand it to handle more.  Either Email me the algorithm, or a suggestion
for a book to read, or (if you must) post it to the net.

    Many thanks in advance ...
 


-- 
     Happy Hacking, Carl  (carl@ncr-tp)

" Ask me no questions and I might not tell you any lies ... fnord ... "