Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » Software » comp.soft-sys.math.mathematica

Topic: The minimum spanning circle problem
Replies: 1   Last Post: Jul 28, 1996 11:18 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Riccardo Rigon

Posts: 1
Registered: 12/7/04
The minimum spanning circle problem
Posted: Jul 24, 1996 7:13 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

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@itnca1.ing.unitn.it







Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.