At least with divide-and-conquer your space requirements goes
logarithmic with the size of the problem. I don't know deCasteljau's
algorithm, but assuming it only needs one non-tail call and it scales
with the pixels in one dimonsion, you could assume 2048 pixels max.
That means you can limit the depth of the stack to 11. If it scales
with the number of pixel in total, you still only need twice that. If
my assumptions are right, it seems feasible to use the block RAM. I'll
leave it to Tim to knock me in the head with a strict block RAM budget ;-)
The curve definitely can't be any longer than twice the width plus twice the height of the screen, and it will be much shorter. So yeah, a pretty short stack will be good enough. I'll probably write it with a generous stack and we can tighten things up once it's working.
_______________________________________________ Open-graphics mailing list [email protected] http://lists.duskglow.com/mailman/listinfo/open-graphics List service provided by Duskglow Consulting, LLC (www.duskglow.com)
