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. ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
