Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!unmvax!ncar!tank!uxc!uxc.cso.uiuc.edu!m.cs.uiuc.edu!s.cs.uiuc.edu!carroll
From: carroll@s.cs.uiuc.edu
Newsgroups: comp.graphics
Subject: fill algorithms
Message-ID: <207400001@s.cs.uiuc.edu>
Date: 22 Feb 89 16:12:00 GMT
Lines: 10
Nf-ID: #N:s.cs.uiuc.edu:207400001:000:584
Nf-From: s.cs.uiuc.edu!carroll    Feb 22 10:12:00 1989


I have a friend who's looking for an area fill algorithm that takes boundary
conditions (such as EQ, NEQ to some color). We've checked the standard
references, but they either don't have it or have the ``push the point and
go all 4 directions'' algorithm, which is unacceptable. Please send E-mail
with either algorithms or pointers to references. Many thanks!

Alan M. Carroll          "How many danger signs did you ignore?
carroll@s.cs.uiuc.edu     How many times had you heard it all before?" - AP&EW
CS Grad / U of Ill @ Urbana    ...{ucbvax,pur-ee,convex}!s.cs.uiuc.edu!carroll