Mathematica 9 is now available
Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
1996
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 1996

[Date Index] [Thread Index] [Author Index]

Search the Archive

The minimum spanning circle problem

  • To: mathgroup at smc.vnet.net
  • Subject: [mg4495] The minimum spanning circle problem
  • From: Riccardo Rigon <rrigon at acs.tamu.edu>
  • Date: Fri, 2 Aug 1996 02:22:27 -0400
  • Organization: EOWR TAMU
  • Sender: owner-wri-mathgroup at wolfram.com

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
I-38050 Mesiano di Povo - TRENTO
ITALY -
ph   : +39-461-882610
fax  : +39-461-882672
email: riccardo at itnca1.ing.unitn.it

==== [MESSAGE SEPARATOR] ====


  • Prev by Date: The farthest apart points problem
  • Next by Date: product of Spher.Harmonics
  • Previous by thread: Re: The farthest apart points problem
  • Next by thread: Re: The minimum spanning circle problem