Timeline for Flood-Fill and scanLine algorithms are line-based floods but I want square based floods
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 23, 2018 at 1:54 | comment | added | information | @SebastiánMestre you can share jsfidle(code complete) please | |
| Nov 22, 2018 at 23:17 | comment | added | ImTalkingCode | Chris, I need to do a lot of testing to determine if the algorithm creates any orphan spots/areas which does not allow additional group areas to be added. | |
| Nov 22, 2018 at 11:11 | comment | added | user9485 | You may run into problems if at some point none of the remaining groups fit entirely in any of the remaining untouched components. I'm not sure if sorting the groups by size or choosing the neighbors in a particular order would solve this. | |
| Nov 22, 2018 at 9:42 | comment | added | Sebastián Mestre | Ohh, i just fixed the code to take that into account. good catch! | |
| Nov 22, 2018 at 9:41 | history | edited | Sebastián Mestre | CC BY-SA 4.0 | added 115 characters in body |
| Nov 22, 2018 at 5:18 | vote | accept | ImTalkingCode | ||
| Nov 22, 2018 at 5:18 | comment | added | ImTalkingCode | Worked very well. I need to only push a neighbour on the queue only if it was not currently a queue entry. The problem was a point (x,y) may have been in the queue and a new neighbour search would find the same (x,y) and since the touch array had not been updated, 2 entries of the same point would be in the queue and this would be replicated many times so the queue got massive and performance really suffered. Also, the multiple entries of the same point would decrement cspots more than once for the same point causing only a section of each group to be drawn. | |
| Nov 22, 2018 at 1:16 | history | answered | Sebastián Mestre | CC BY-SA 4.0 |