Path: utzoo!mnetor!uunet!seismo!sundc!pitstop!sun!decwrl!purdue!i.cc.purdue.edu!j.cc.purdue.edu!pur-ee!uiucdcs!uxc.cso.uiuc.edu!uxe.cso.uiuc.edu!mcdonald
From: mcdonald@uxe.cso.uiuc.edu
Newsgroups: comp.graphics
Subject: Re: FAST flood fill
Message-ID: <46900016@uxe.cso.uiuc.edu>
Date: 28 Apr 88 18:12:00 GMT
References: <1210@sbcs.sunysb.edu>
Lines: 16
Nf-ID: #R:sbcs.sunysb.edu:1210:uxe.cso.uiuc.edu:46900016:000:534
Nf-From: uxe.cso.uiuc.edu!mcdonald    Apr 28 13:12:00 1988



>What is the FASTEST flood fill algorithm ?

>If anyone has any C programs fragments that
>impliment a VERY FAST flood fill, could they
>please mail them to me.  I currently have
>a simple recursive flood fill program running
>but it is just too SLOW for my needs.
>(I am running it on a Sun 3/50 and Sun 3/110)

I too would like to get a copy of one of these.

Doug McDonald  (mcdonald@b.scs.uiuc.edu) 
                (please note the different address from the note you
                 presumably read a couple of minuts ago)