Services & ResourcesWolfram ForumsMathGroup Archive

[Date Index] [Thread Index] [Author Index]

K-nearest neighbhors on an equispaced multidimensional grid

• To: mathgroup at smc.vnet.net
• Subject: [mg72018] K-nearest neighbhors on an equispaced multidimensional grid
• From: "erwann.rogard at gmail.com" <erwann.rogard at gmail.com>
• Date: Fri, 8 Dec 2006 06:18:09 -0500 (EST)

hi,

i am looking for an algorithm/data structure to find the K-nearest
neighbors on an equispaced multidimensional grid.

x=(x_1,...,x_D) where x_d takes values in (...,-1,0,1,...)  for all
d=1,...,D

for example if D=2 and x=(0,0) the

1-NN is x itself
5-NN are x, (-1,0), (0,-1),(1,0),(0,1)
9-NN are x, (-1,0), (0,-1),(1,0),(0,1),(-1,-1),(-1,1),(1,-1),(1,1)

etc...

thanks,

e.