Drexel dragonThe Math ForumDonate to the Math Forum


Math Forum
 Ask Dr. Math
 Discussions
 Internet Newsletter
 MathTools
 Problems of the Week
 Teacher2Teacher
 Teacher Exchange
 Workshops

Search All of the Math Forum:
Browse our Internet Mathematics Library

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


Math Forum » Discussions » Software » comp.soft-sys.math.mathematica

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

Advanced Search
Reply to this Topic Reply to this Topic

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Ray Koopman

Posts: 3,362
Registered: 12/7/04
Re: Euclidean distance of all pairwise combinations (redundants)
Posted: Feb 1, 2013 1:16 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On Jan 31, 5:46 pm, vasiliadesmixa...@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...

Partition[Norm/@Plus@@Transpose@Tuples@{list1,-list2},Length@list2]

{{1, Sqrt[5]}, {1, Sqrt[5]}, {Sqrt[13], Sqrt[5]}}

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2013. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.