Announcement

Collapse
No announcement yet.

KD-Tree Algorithm

Collapse
X
 
  • Filter
  • Time
  • Show
Clear All
new posts

  • KD-Tree Algorithm

    Hello all,

    I'm trying to find out if someone has written or has knowledge of how to implement a K-D Tree algorithm to find nearest neighbours for datapoints. The technique can work for N-dimensional systems, but I am only looking for 2-dimensional systems. I know brute force can work, but it is extremely slow for the number of datapoints I need to sift through.

    Any assistance or pointers would be appreciated.

    best regards

    Andrew
    --------------
    andrew dot lindsay at westnet dot com dot au

  • #2
    For those unfamiliar with K-D Trees.
    Rod
    In some future era, dark matter and dark energy will only be found in Astronomy's Dark Ages.

    Comment

    Working...
    X