carl@ncr-tp.UUCP (Carl Kuck) (04/15/85)
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 ... "