On Wed, Feb 3, 2010 at 6:22 PM, Alex Tweedly <[email protected]> wrote:
> Jeff Massung wrote: > >> Michael, >> >> Sorry, but the problem you are running into is that (in your second >> example) >> >> > The examples were from me (Alex) not Michael :-) > <http://lists.runrev.com/mailman/listinfo/use-revolution> > Lol, I noticed that just as I hit "send" ;-) Yes. There are insane cases for which there may - in fact - be no correct answer (especially if the polygon does intersect with each other... at which point the debate begins on the definition of "polygon" beyond just being "an n-sided object"). Neither of us can say what Michael's original use cases are/were, and hopefully the cross-product solution works for him just fine. The options I gave for concave polygons (assuming no intersections) do work and are used in tessellation algorithms and elsewhere. There's no need to complicate the solution w/o even knowing if the problem warrants it. ;-) Jeff M. _______________________________________________ use-revolution mailing list [email protected] Please visit this url to subscribe, unsubscribe and manage your subscription preferences: http://lists.runrev.com/mailman/listinfo/use-revolution
