Split your shape to rectangles and fill them instead, this won't use search of boundary pixels and so should be twice faster, I expect.
time ago a mrc user posted a paint (flood fill) routine tha uses more efficiencly z80 & vdp color search function & byte fill function when possible, but i do not remember who was. it also had the additional bonus that you were not required to specify the border color for the region you want to fill, simply it stop in any color that is different from the color of the pixels where you specify to start from filling.
time ago a mrc user posted a paint (flood fill) routine tha uses more efficiencly z80 & vdp color search function & byte fill function when possible, but i do not remember who was
Mmmm, ¿Dolphin101546015?
Maybe was Dolphin101546015 --- i do not remember
Found the thread, maybe this: Looking for a PAINT routine for MSX2
Maybe he wants that his code work on msx1 too... so no commamd is allowed...
And probably (but I could be mistaken) he is working on a 3D poligon engine (no wireframe, due to areas filling).
So he need a way to fill poligons in a fast way
My function is not using FlodFill algorithm.
FlodFill is recursive method painting area with near pixels and checking bounds in all ways.
Its very slow for MSX and need very big stack ram.