So I converted the next algorithm in the list immediately following the Delaunay
triangulation - 2D convex hull.
Hit a few snags, but puzzled it all out in the end.
(I mean, how do you guys like "#for ( ; ; )" :O )
Anyway it works, and it's fast. It processed 500 points in 0.919 seconds.
This one makes me so damn happy. :)
Post a reply to this message
Download 'convexhull.png' (84 KB)
Preview of image 'convexhull.png'