|
[Date Index]
[Thread Index]
[Author Index]
The farthest apart points problem
- To: mathgroup at smc.vnet.net
- Subject: [mg4502] The farthest apart points problem
- From: Riccardo Rigon <rigon at csrp.tamu.edu>
- Date: Fri, 2 Aug 1996 02:22:31 -0400
- Organization: EOWR TAMU
- Sender: owner-wri-mathgroup at wolfram.com
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
|