
Hi everyone
Im working on a project to do with convex hulls In mathematics. The convex hull or convex envelope for a set of points X in a real vector space V is the minimal convex set containing X.
For planar objects, i.e., lying in the plane, the convex hull may be easily visualized by imagining an elastic band stretched open to encompass the given object; when released, it will assume the shape of the required convex hull. Daunting.
Can somebody please help me get the code in any language to find the convex hull of circles of same radius. I would be delighted.



Odd place to ask this question  you should find more appropriate forums.
But since this is quick for me, check out
http://code.google.com/p/nettopologysuite/source/browse/branches/v2.0/NetTopologySuite/Algorithm/ConvexHull.cs. That uses a Graham Scan algorithm, which is probably the most prevalant.
There are possibly better algorithms for your needs if you look around. Check out the topic of
computational geometry in general, and you'll find a wealth of information... but almost none of it is on CodePlex!

