I think this is really easy, however, since I'm gonna be pretty specific, I'm givin' it 100 pts... ;-)
Anyway.... this is an ALGORITHM question not c++, but I couldn't find a better spot for it (and I'm using c++).
SO: I need an algorithm that will take a CONVEX polygon and convert it to scan lines. The polygon is described by its vertices in CW or CCW order. (This is used in a real-time 3D renderer, so I need speed). I've got a working version, but it's not fast enough.
I've searched all over the net, and even found some AMBIGUOUS pseudocode of the "active-edge" algorithm, but always missing SOME details.
So, all I want is a better (read quicker) algorithm than the one I'm using. If you can give me an algorithm or point me to one which I can use, you win! :-)
Thank you in advance,