Deutsch English Français Italiano |
<utbtlp$q5hs$1@dont-email.me> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!weretis.net!feeder8.news.weretis.net!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail From: Malcolm McLean <malcolm.arthur.mclean@gmail.com> Newsgroups: comp.lang.c Subject: Re: filling area by color atack safety Date: Tue, 19 Mar 2024 11:41:45 +0000 Organization: A noiseless patient Spider Lines: 34 Message-ID: <utbtlp$q5hs$1@dont-email.me> References: <ut3669$21eur$1@i2pn2.org> <ut4020$2s8ov$1@dont-email.me> <20240317144625.00002011@yahoo.com> <86y1afopik.fsf@linuxsc.com> <ut97c4$4rqf$1@dont-email.me> <861q86ojfm.fsf@linuxsc.com> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 7bit Injection-Date: Tue, 19 Mar 2024 11:41:45 -0000 (UTC) Injection-Info: dont-email.me; posting-host="7afaabf9fdb4883652af28e583b6382d"; logging-data="857660"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX19NHWSm+p7MTe2NzZkVT3lDzOaVKYZJAlU=" User-Agent: Mozilla Thunderbird Cancel-Lock: sha1:djwV6g/pRAT82LrMVDln5kTxVyI= In-Reply-To: <861q86ojfm.fsf@linuxsc.com> Content-Language: en-GB Bytes: 2491 On 19/03/2024 05:54, Tim Rentsch wrote: > Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes: > >> On 18/03/2024 09:30, Tim Rentsch wrote: >> >>> Michael S <already5chosen@yahoo.com> writes: > [...] >>>> Except I don't understand why it works it all. >>>> Can't fill area have sub-areas that only connected through >>>> diagonal? >>> >>> It is customary in raster graphics to count pixels as adjacent >>> only if they share an edge, not if they just share a corner. >>> Usually that gives better results; the exceptions tend to need >>> special handling anyway and not just connecting through >>> diagonals. >> >> Though with a binary image, if the foreground is 4-connected, the >> background must therefore be 8-connected. > > It might be but it doesn't have to be. > > Also different terminology should be used, since 4-connected > (also N-connected, for other integer N) has a specific meaning in > graph theory, and one very different than what is meant above. That is the terminology in binary image processing. The pixels are 4-connected or 8-connected depending on whether a shared corner is considered to make the group of pixels two objects or one object. -- Check out Basic Algorithms and my other books: https://www.lulu.com/spotlight/bgy1mm