Re: Distance problem
- To: mathgroup at smc.vnet.net
- Subject: [mg16334] Re: [mg16256] Distance problem
- From: Jurgen Tischer <jtischer at col2.telecom.com.co>
- Date: Sun, 7 Mar 1999 01:05:51 -0500
- Organization: Universidad del Valle
- References: <199903050541.AAA13680@smc.vnet.net.>
- Sender: owner-wri-mathgroup at wolfram.com
Mietta, judging from your organization description I would say you can't. Imagine 5 points with all distances equal 1. (In phonetics not uncommon, as I understand.) Then you can't realize this discrete metric space as a subspace of euclidean R^3. Maybe it's easier for you to see that you can realize a three point set in R^2 (an equilateral triangle), but not a four point set, in R^3 a four point set (a tedrahedron), and so on. Jurgen Mietta Lennes wrote: > > Hello! > > I have a problem. > > I need to draw a figure picturing the relative interdistances of a limited > set of labeled points. The distance of each point to every other point is > known. On the basis of this information, is there a way to draw a 2- or > 3-dimensional "map" where each point's location (coordinates) corresponds > to its distance to other points? On which terms is this possible? > > Is there a computer program that can at least approximate this? > > I am writing a paper in which this kind of figures would be most useful > and enlightening... but I need the information fast. Please mail any > possible answers straight to me. > > Thank you very much! > > Mietta Lennes > mietta.lennes at helsinki.fi
- References:
- Distance problem
- From: mietta.lennes@Helsinki.FI (Mietta Lennes)
- Distance problem