ocit.inc at MCI2000.com
Sat Sep 5 05:35:14 UTC 1998
The convex hull of a set of points is the smallest convex set that contains
What I meant by "convex hull algorithm" was the algorithm that determined
the convex polygon given the above definition.
There is a lot of material and source code out there mainly in C . There are
also some Java applets. Somebody in this discussion group had distributed
code for Voronoi diagrams and I thought that perhaps the same person might
have something in Squeak for convex hulls.
From: Alessandro Manunza <manunza at elettro1.unica.it>
To: squeak at cs.uiuc.edu <squeak at cs.uiuc.edu>
Date: Friday, September 04, 1998 3:29 AM
Subject: R: Convex hulls
excuse me, what is a "convex hull algorithm "?
> Da: ocit.inc <ocit.inc at MCI2000.com>
> A: squeak at cs.uiuc.edu
> Oggetto: Convex hulls
> Data: venerdì 4 settembre 1998 6.56
> I am on the verge of attempting to implement an ST version of a convex
> algorithm however I'm kind of busy at the moment and would prefer to
> Can anybody help?
More information about the Squeak-dev