Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.soft-sys.math.mathematica > #13329
| From | Bob Hanlon <hanlonr357@gmail.com> |
|---|---|
| Newsgroups | comp.soft-sys.math.mathematica |
| Subject | Re: Euclidean distance of all pairwise combinations (redundants) |
| Date | 2013-02-01 06:16 +0000 |
| Message-ID | <kefmjb$ljc$1@smc.vnet.net> (permalink) |
| References | <k7ve05$s08$1@smc.vnet.net> |
| Organization | Time-Warner Telecom |
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@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...
>
Back to comp.soft-sys.math.mathematica | Previous | Next — Previous in thread | Find similar | Unroll thread
Euclidean distance of all pairwise combinations (redundants) Jesse Pisel <jessepisel@gmail.com> - 2012-11-14 06:33 +0000
Re: Euclidean distance of all pairwise combinations (redundants) "Nasser M. Abbasi" <nma@12000.org> - 2012-11-15 09:07 +0000
Re: Euclidean distance of all pairwise combinations (redundants) Ray Koopman <koopman@sfu.ca> - 2012-11-18 09:03 +0000
Re: Euclidean distance of all pairwise combinations (redundants) vasiliadesmixalis@gmail.com - 2013-02-01 01:46 +0000
Re: Euclidean distance of all pairwise combinations (redundants) Ray Koopman <koopman@sfu.ca> - 2013-02-01 06:16 +0000
Re: Euclidean distance of all pairwise combinations (redundants) Francisco Gutierrez <fgutiers2002@yahoo.com> - 2013-02-01 06:15 +0000
Re: Euclidean distance of all pairwise combinations (redundants) Bob Hanlon <hanlonr357@gmail.com> - 2013-02-01 06:16 +0000
csiph-web