On Jan 11, 2008 12:55 PM, Lars Strand <[EMAIL PROTECTED]> wrote: > A number of points are given. The problem is to determine the smallest, > convex region which includes all of the points.
The Cormen, Leiserson, Rivest, Stein: ''Introduction to Algorithms'' book has lots of details about convex hull algorithms. I've written a convex program in C before knowing about this book. It was for a competition task: "http://www.komal.hu/verseny/2001-12/szt.e.shtml";. The algorithm of my solution isn't the best, but it at least worked (the official solution definitely has bugs). I can't tell from this far why I've got zero marks for it. (I can post the code (272 lines of C) if anyone's interested in it.) Ambrus ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
