Re: Euclidean distance of all pairwise combinations (redundants)
- To: mathgroup at smc.vnet.net
- Subject: [mg129633] Re: Euclidean distance of all pairwise combinations (redundants)
- From: vasiliadesmixalis at gmail.com
- Date: Thu, 31 Jan 2013 20:47:41 -0500 (EST)
- Delivered-to: l-mathgroup@mail-archive0.wolfram.com
- Delivered-to: l-mathgroup@wolfram.com
- Delivered-to: mathgroup-newout@smc.vnet.net
- Delivered-to: mathgroup-newsend@smc.vnet.net
- References: <k7ve05$s08$1@smc.vnet.net>
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...