Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2006
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2006

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

Search the Archive

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.


  • Prev by Date: Problem with text rendering on Linux.
  • Next by Date: On Reduce
  • Previous by thread: Re: Problem with text rendering on Linux.
  • Next by thread: Re: K-nearest neighbhors on an equispaced multidimensional grid