> So far, my C++ implementation is very fast, for not being coded with ASM> and all. I was able to implement a few speedups, like not using> sqrt(x*x+y*y) for *every pixel*, but instead making a 1/4 circle 2D> array and picking from that.
You're doing a radius comparison, right? You probably don't need to take
a square root.
- Slime
