Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.soft-sys.math.mathematica > #12351

Re: Euclidean distance of all pairwise combinations (redundants)

From "Nasser M. Abbasi" <nma@12000.org>
Newsgroups comp.soft-sys.math.mathematica
Subject Re: Euclidean distance of all pairwise combinations (redundants)
Date 2012-11-15 09:07 +0000
Message-ID <k82bbk$7mn$1@smc.vnet.net> (permalink)
References <k7ve05$s08$1@smc.vnet.net>
Organization Time-Warner Telecom

Show all headers | View raw


On 11/14/2012 12:33 AM, Jesse Pisel wrote:
>
> list = {{1, 1}, {2, 2}, {3, 3}}
> EuclideanDistance @@@ Subsets[list, {2}]
>
> Any ideas on how to get the euclidean distance between all the points
>including redundants and self references?
>
>

may be

------------------
list = {{1, 1}, {2, 2}, {3, 3}}
EuclideanDistance @@@ Tuples[list, 2]
-----------------


{0,Sqrt[2],2 Sqrt[2],Sqrt[2],0,Sqrt[2],2 Sqrt[2],Sqrt[2],0}
  
--Nasser

Back to comp.soft-sys.math.mathematica | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread


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