Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
Drexel University or The Math Forum.



The minimum spanning circle problem
Posted:
Jul 24, 1996 7:13 PM


Consider the following Computational Geometry problem: given a set of n points {p_1, ....p_n} in the plane find the center and the radius of the smallest circle such that no point is exterior to the circle.
Actually I am looking for the distance of the two farthest apart points of the set, and I know that my points are the vertices of a convex hull.
Do someone knows a simple and efficient computational solution for this problem ?
Thank you in advance for any help
Riccardo Rigon Dipartimento di Ingegneria Civile e Ambientale I38050 Mesiano di Povo  TRENTO ITALY  ph : +39461882610 fax : +39461882672 email: riccardo@itnca1.ing.unitn.it



