Hey all!
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, 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!
-------------------------------------------------------------------------
This SF.net email is sponsored by the 2008 JavaOne(SM) Conference
Don't miss this year's exciting event. There's still time to save $100.
Use priority code J8TL2D2.
http://ad.doubleclick.net/clk;198757673;13503038;p?http://java.sun.com/javaone
_______________________________________________
Geotools-gt2-users mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/geotools-gt2-users
