Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!ames!pasteur!ucbvax!ucsfcgl!pixar!fishkin
From: fishkin@pixar.UUCP (Ken Fishkin)
Newsgroups: comp.graphics
Subject: Re: fill algorithms
Message-ID: <3216@pixar.UUCP>
Date: 27 Feb 89 22:32:23 GMT
References: <207400001@s.cs.uiuc.edu>
Reply-To: fishkin@pixar.UUCP (Ken Fishkin)
Organization: Pixar -- Marin County, California
Lines: 20

In article <207400001@s.cs.uiuc.edu> carroll@s.cs.uiuc.edu writes:
>
>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.

Try any or all of these:

    Marc S. Levoy, "Area Flooding Algorithms".
Presented at SIGGRAPH '82 2-D Animation Tutorial.
    Uri Shani, "Filling Regions in Binary Raster Images: A Graph-Theoretic
Approach", pp. 321-327, SIGGRAPH '80.
    Alvy Ray Smith, "Tint Fill", pp. 276-283, SIGGRAPH '79.
    Alvy Ray Smith, "Fill Tutorial Notes", presented at '82 SIGGRAPH
2-D Animation Tutorial.
    Ken Fishkin, "An Analysis and Algorithm for Filling Propogation",
pp. 203-212, Graphics Interface '85.
-- 
Ken Fishkin	...{ucbvax,sun}!pixar!fishkin