How does flood fill work?

preview_player
Показать описание

Source code: In chapter

Рекомендации по теме
Комментарии
Автор

Flood fill a.k.a. the inefficient path finder

cout
Автор

Or, you could mark a vertex as visited, which is more or less the same as coloring it as you go in the bf traversal. Nice video!

leanobajio
Автор

Awesome explanation! It helped me a lot when I tried to create an Etch-a-Sketch game. I have watched lots of other explanations but yours is the best hands down.
I really cannot express enough how grateful I am for your video and a respective article on the archive.

Pavel-wjgy
Автор

One more thing to mention is that recursive version of flood fill can get stack owerflow exception if you try to flood fill big maze. I got this exception with maze image 4000x4000.

Автор

I like how you explain things, very easy to follow and very relateable!

dotanon
Автор

I solved this in 1996 by pushing the points onto a stack and popping them randomly. Random popping keeps the stack size minimized without slowing down the search - this is better than either depth first (which can make the stack blow up very large) and breadth first (which can delay leaks into new regions)

idjles
Автор

I like this video! I've never seen the graph abstraction applied to pixels before, it makes sense!

TheKirkster
Автор

Just wanted to say this is a phenomenal video.

pau
Автор

Thanks a lot. I'd never implemented flood fill before and this was a great introduction to it. Had it working in no time.

KasperFrandsen
Автор

Thanks for the video! Flood fill is easy to understand, but implementing it efficiently is quite difficult. I'm currently using a Hoshen-Kopelman implementation for domain labeling on a 3D lattice, but performance still isn't ideal.

ProjectPhysX
Автор

This was great, I would love more on cellular graphical algorithms

cabbageman
Автор

Are you going to add a chapter to the algorithm archive on maze generation at any point? There's like 14 different algorithms and some of them are really interesting.

iminni
Автор

Awesome video. This is pretty unrelated, but is it possible to have a software that converts mp3 into a sum of sine functions and then express that function algebraically? For example, since we can visualise sound in visualiser software or simply by putting for example sand on a speaker, we can express the process that's going on. A lot of sound visualisation methods rely on Fourier methods and I know you have experience with Fourier-stuff so if you have any ideas that'd be cool.

laviekolchinsky
Автор

Great video as always! I mainly got into coding because of desiring to simulate and visualize or plot concepts from physics and mathematics. I do have a question, what software do you use to edit the videos?

heliumhydride
Автор

What are those lines of code above you on the screen

carbylamine
Автор

Thankfully that 6:33 didn't turn into a swastika.

jojojorisjhjosef
Автор

I was curious about your terminal game, but the specterm.jl
repo just has a README and a LICENSE

HebaruSan
Автор

Wow awesome video. Thanks. using Julia is great too

TenderBug
Автор

I will never understand why some people think that recursion is somehow easier or more natural.

empireempire
Автор

Which coding program and software do you use? I think Lua myself. But it doesn't wuite seem like it. Thanks

thomaslikesgames