Xref: utzoo comp.windows.x:11844 comp.graphics:6613
Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!rutgers!psuvax1!psuvm!cunyvm!ndsuvm1.bitnet!nu113738
From: NU113738@NDSUVM1.BITNET
Newsgroups: comp.windows.x,comp.graphics
Subject: Re: A fast algorithm to find all closed regions in an image
Message-ID: <2579NU113738@NDSUVM1>
Date: 25 Jul 89 09:49:36 GMT
References: <12247@eddie.MIT.EDU>
Organization: North Dakota Higher Education Computer Network, Fargo, ND
Lines: 16
Disclaimer: Author bears full responsibility for contents of this article.

If you need an algorithm to determine if an area is enclosed and return
the edge points, what you might want to do is dig up a flood fill algorithm
and just do a flood fill somewhere in memory and not on the image.  Remove
the statements that would perform the actual fill in of pixels and just
keep track in memory.

If you find a good algorithm, it should be fairly quick, since the you
wouldn't have to write to the display memory.


If you want me to send you some algorithms that I've collected from others
for flood fills, mail me.   I couldn't directly replay via the news system.


Jeff Bakke
NU113738@NDSUVM1.BITNET