atan2 should do the trick "Bart Wttewaall" <[EMAIL PROTECTED]> wrote in message news:[EMAIL PROTECTED] Hi List,
I'm looking for an algorithm that sorts a collection of points counter-, or clockwise by (probably) means of comparing each point to the center point of the collection. Calculating the centerpoint wasn't too hard, but I'm stuck at the comparing part. It doesn't matter which point the returning array begins with, but I'd like the method to be as fast as possible since it will be called every frame. I'm not asking for a complete solution (although appreciated) but for a few tips how to tackle this one. Thanks, Bart Wttewaall _______________________________________________ Flashcoders@chattyfig.figleaf.com To change your subscription options or search the archive: http://chattyfig.figleaf.com/mailman/listinfo/flashcoders Brought to you by Fig Leaf Software Premier Authorized Adobe Consulting and Training http://www.figleaf.com http://training.figleaf.com _______________________________________________ Flashcoders@chattyfig.figleaf.com To change your subscription options or search the archive: http://chattyfig.figleaf.com/mailman/listinfo/flashcoders Brought to you by Fig Leaf Software Premier Authorized Adobe Consulting and Training http://www.figleaf.com http://training.figleaf.com
