Thanks Devon for the direction about hull, I am going to use it. The problem that I am proposing is to find the smallest circle that contains an irregular polygon. The polygon may be convex or concave.
I have a procedure that makes it in J but I'm not sure that can be applied to any polygon. With examples where I have applied has given me results. If you like I could send you the script. Seems that this script was done with APL360. I believe that when I know more about J can make it more elegant. ¡S A L U D! Alfonso There is some convex hull code on the wiki at http://www.jsoftware.com/jwiki/DevonMcCormick/convexHull . On Fri, Feb 13, 2009 at 6:00 PM, Boyko Bantchev <[email protected]> wrote: > 2009/2/13 Alfonso Salazar <[email protected]>: > > Does anyone know a procedure in J or APL to find the lowest circle > surrounding or containing an irregular polygon? > > Do you mean finding the minimal-area disk that encloses the > polygon? As I see it, the question is not specific to APL/J > (or any other language)? > Anyway, you could find the convex hull of the polygon, and then > find the minimal disk enclosing that hull. Both can be done > in linear time w.r.t. the number of vertices of the given polygon. > ---------------------------------------------------------------------- __________________________________________________ Correo Yahoo! Espacio para todos tus mensajes, antivirus y antispam ¡gratis! Regístrate ya - http://correo.yahoo.com.mx/ ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
