MathGroup Archive 1996

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

Search the Archive

The farthest apart points problem


Let us have n points in a plane being the vertices
of a convex hull. 
Do you know a fast and simple algorithm to
determine which pairs is separated by the largest
distance ?

Thank you in advance for any help,

Riccardo

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


  • Prev by Date: Comparison of Mathematica on Various Computers
  • Next by Date: The minimum spanning circle problem
  • Previous by thread: Comparison of Mathematica on Various Computers
  • Next by thread: Re: The farthest apart points problem