So I converted the next algorithm in the list immediately following the Delaunay
triangulation - 2D convex hull.

https://people.math.sc.edu/Burkardt/cpp_src/geompack/geompack.cpp

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

Attachments:
Download 'convexhull.png' (84 KB)

Preview of image 'convexhull.png'

hi,

"Bald Eagle" <cre### [at] netscapenet> wrote:
> ...
> (I mean, how do you guys like "#for ( ; ; )"   :O )
> ...

likely I'd write 'while(true)' instead, but that 'for' is (just) another "common
C idiom" (see <http://news.povray.org/63c642db%40news.povray.org>).


regards, jr.

Post a reply to this message