Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.lang.c > #144600

Re: OT: Flood fill algorithm (Graphics)

Show all headers | View raw

On Fri, 7 Jun 2019 07:57:05 -0700 (PDT), Malcolm McLean
<malcolm.arthur.mclean@gmail.com> wrote:

>On Friday, 7 June 2019 07:55:07 UTC+1, fir  wrote:
>>
>> good you ask on graphics topics imo (as they are ok imo) but this 
>> flod fill is of relatively small practical usage..almost nobody uses it
>>
>It's not used much for drawing any longer as it requires colour regions
>to be flat-shaded and not anti-aliased, which for most uses is too 
>simple. But it's still important for binary image processing, largely
>for labelling regions of the binary image.

Just so. Even for graphics, it's not a huge problem to accomodate a
"fuzzy" match of HSV color characteristics.

It's also been on my mind that a raster image is a special case of an
undirected graph, and *that* is interesting. It gets me thinking on
how I'd approach a flood algorithm aimed at an arbitrarily complex
N-connected graph. A raster is a nice way to visualize how it works in
a limited space.

Back to comp.lang.c | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread

Thread

OT: Flood fill algorithm (Graphics) nobody@example.org (Scott) - 2019-06-07 04:02 +0000
  Re: OT: Flood fill algorithm (Graphics) fir <profesor.fir@gmail.com> - 2019-06-06 23:54 -0700
    Re: OT: Flood fill algorithm (Graphics) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2019-06-07 07:57 -0700
      Re: OT: Flood fill algorithm (Graphics) nobody@example.org (Scott) - 2019-06-07 16:06 +0000
      Re: OT: Flood fill algorithm (Graphics) jadill33@gmail.com - 2019-06-07 09:56 -0700
  Re: OT: Flood fill algorithm (Graphics) unidef <jon@unidef-systems.com> - 2019-06-10 02:47 -0500
  Re: OT: Flood fill algorithm (Graphics) Peter 'Shaggy' Haywood <phaywood@alphalink.com.au> - 2019-06-13 00:25 +1000

csiph-web