Search All of the Math Forum:

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

Topic: Euclidean distance of all pairwise combinations (redundants)
Replies: 7   Last Post: Feb 1, 2013 1:16 AM

 Messages: [ Previous | Next ]
 Francisco Gutierrez Posts: 102 Registered: 5/31/05
Re: Euclidean distance of all pairwise combinations (redundants)
Posted: Feb 1, 2013 1:15 AM

One way would be with Outer. Simply take care of plugging in the level at which you want the operation performed.lista1={{1,1,1},{1,3,1},{3,2,4}}
lista2={{1,2,1},{1,2,3}}

Outer[EuclideanDistance,lista1,lista2,1]

Note the 1 at the end, for level 1.

Ouput: {{1,Sqrt[5]},{1,Sqrt[5]},{Sqrt[13],Sqrt[5]}}
Francisco

________________________________

Sent: Thursday, January 31, 2013 8:47 PM
Subject: Re: Euclidean distance of all pairwise combinations (redundants)

Hi,

I am wondering on how to get the euclidean distance between all the point from two different list .

For example : list1=[{1,1,1},{1,3,1},{3,2,4}] , list2=[{1,2,1},{1,2,3}] etc.

how to find the euclidean comparing all the pairs ?? {1,1,1} with {1,2,1} and then {1,1,1} with {1,2,3} etc...

Date Subject Author
11/14/12 Jesse Pisel
11/15/12 Nasser Abbasi
11/18/12 Ray Koopman
2/1/13 Francisco Gutierrez
2/1/13 Ray Koopman
2/1/13 Bob Hanlon