Hey all! First of all hello everybody! because I've just joined the list. I'm working on an alternative to the Graham scan for calculate the convex hull of a geometry. This algorithm is called Andrew's Monotone Chain, or just Andrew's algorithm, or something like that.., it computes the upper and lower hulls of a monotone chain of points and it's supposed to be faster than the Graham scan.
I've implemented that algorithm but it doesn't work in all the cases and I can't see the problem so, before keep going crazy trying to figure the problem out I've decided to ask if anybody has already implemented it and it's so nice to share the code ;) Thanks in advance! Gloria
_______________________________________________ jts-devel mailing list [email protected] http://lists.refractions.net/mailman/listinfo/jts-devel
