Hi,

I can't help but feel like a noob once again, so I need to ask this before my head goes through the wall.

I'm working on a rotation algorithm. Basically, I have an angle (in rad) and a target angle (in rad) and I need to figure out whether the shortest rotation between the two is clockwise or counter-clockwise.

I've devised a bunch of algorithms, but all of them with complex exceptions to handle the wrap of the angle.

My circle is -Pi to Pi (where Pi and -Pi occupy the exact same position, which is the opposite to 0).

Anybody got a clue how to solve this 'elegantly'?

Thanks