Re: Euclidean distance of all pairwise combinations (redundants)

• To: mathgroup at smc.vnet.net
• Subject: [mg129639] Re: Euclidean distance of all pairwise combinations (redundants)
• From: Bob Hanlon <hanlonr357 at gmail.com>
• Date: Fri, 1 Feb 2013 01:16:54 -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>

```It isn't clear what form you want the output to take

list1 = Array[a, {3, 3}];

list2 = Array[b, {2, 3}];

list3 = Outer[Norm[#1 - #2] &, list1, list2, 1]

or

list3 // Flatten

Bob Hanlon

On Thu, Jan 31, 2013 at 8:47 PM,  <vasiliadesmixalis at gmail.com> wrote:
> 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...
>

```

• Prev by Date: Re: Euclidean distance of all pairwise combinations (redundants)
• Next by Date: Re: Mathematica and Lisp
• Previous by thread: Re: Euclidean distance of all pairwise combinations (redundants)
• Next by thread: Re: Mathematica and Lisp