Re: Minimization
- To: mathgroup at smc.vnet.net
- Subject: [mg42263] Re: Minimization
- From: bobhanlon at aol.com (Bob Hanlon)
- Date: Thu, 26 Jun 2003 05:36:20 -0400 (EDT)
- References: <bdbeu1$2dq$1@smc.vnet.net>
- Sender: owner-wri-mathgroup at wolfram.com
Take[Sort[l1,
Tr[(#1 - {x0, y0, z0})^2] <
Tr[(#2 - {x0, y0, z0})^2] &], 5]
Bob Hanlon
In article <bdbeu1$2dq$1 at smc.vnet.net>, Moranresearch at aol.com wrote:
<< Subject: Minimization
From: Moranresearch at aol.com
To: mathgroup at smc.vnet.net
Date: Wed, 25 Jun 2003 06:19:45 +0000 (UTC)
I have a list of points l1= (xi,yi, zi) and a target point (x0,y0,z0) how
would I efficiently find the 5 points in l1 closest to, ie with the smallest
Euclidian disance to, the target point? Thank you.