New algorithm for good point browsing, implemented in
bisection-algorithm/adaptative-pixel-size/doubling-iteration
crushes on run time performance! The key insight was to utilize the coming across points with lower iteration count in flood fill to recursively restart flood fill from it. Logically, there is no risk of infinite loop, since you can only restart so many times, and the recursion naturally leads algorithm to 'climb' its way from the shores into the summit of an island. If the topology is reversed, (namely, that of a lake), then recursion naturally leads algorithm away from the lake.
...
Whatever the case, for some reason, that doesn't automatically propagate into stage 2.
Understand why and fix it.
After fix, we will need to log and visually document the process.
New algorithm for good point browsing, implemented in
bisection-algorithm/adaptative-pixel-size/doubling-iteration
crushes on run time performance! The key insight was to utilize the coming across points with lower iteration count in flood fill to recursively restart flood fill from it. Logically, there is no risk of infinite loop, since you can only restart so many times, and the recursion naturally leads algorithm to 'climb' its way from the shores into the summit of an island. If the topology is reversed, (namely, that of a lake), then recursion naturally leads algorithm away from the lake.
...
Whatever the case, for some reason, that doesn't automatically propagate into stage 2.
Understand why and fix it.
After fix, we will need to log and visually document the process.