comp.lang.idl-pvwave archive
Messages from Usenet group comp.lang.idl-pvwave, compiled by Paulo Penteado

Home » Public Forums » archive » Re: checking for connectedness of a given set of pixels
Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend 
Return to the default flat view Create a new topic Submit Reply
Re: checking for connectedness of a given set of pixels [message #73312 is a reply to message #73311] Wed, 03 November 2010 06:32 Go to previous messageGo to previous message
guillermo.castilla.ca is currently offline  guillermo.castilla.ca
Messages: 27
Registered: September 2008
Junior Member
> You might try some variation of the chain-code algorithm then

I see what you mean David. So you pick from the input set the pixel
with lowest 1D index, which necessarily lies in the boundary of (one
of) the region(s), find the boundary of that region with
Find_Boundary, use that boundary as input to POLYFILLV as to get the
addresses of the pixels within it, and if there are some pixels in the
input set that do not belong to boundary+interior, then you know the
input set is not connected. However, if no pixel is outside but the
boundary+interior contains more pixels than the input set, then you
have to make additional checks to make sure that the holes are not
such that some group from the input set is disconnected from the rest.
At the end of the day, it might make more sense to stick to
Label_Region :( Thanks anyways for the advice.

Cheers

Guillermo
[Message index]
 
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Previous Topic: Random NetCDF I/O error
Next Topic: Re: Random NetCDF I/O error

-=] Back to Top [=-
[ Syndicate this forum (XML) ] [ RSS ] [ PDF ]

Current Time: Wed Oct 08 20:14:25 PDT 2025

Total time taken to generate the page: 0.00488 seconds