fill point maximum

[Agamemnus]

Doesn't have to be a perfect fill. There are two types of fill:

E W N S and:
E W N S NE NW SE SW

Code:

With Heckbert fill you are reasonably safe with a number of stack entries equal to 4*biggest_dimension_of_the_array (2560 entries for a 640x480 screen).

I think you have to take into account both arrays. Are you talking abut a diamond fill?: (x ^ 2 + y ^ 2)^.5 * 4

Hilbert curve? Wow, that looks like what I had in mind - something wiggly and squiggly! Neat!

For the same algorithm , changing the stack to a FIFO queue reduces a lot the need for stack space...

You could probably do some reasoning to find an exact figure, but you should base it in the algorithm used.

I can post the fill benchmark i did if you are interested.

Hmm.. can elaborate some more on a FIFO queue...? Just an optimization, or reduces stack entries?

Fill benchmark isn't necessary as my fill isn't really a fill, it's a pathfinding program (which for these purposes isn't the same thing) that works on arrays not on the screen...

This Hilbert curve is just what I'm looking for!