Skip to content
/ KDTree Public
forked from crvs/KDTree

Simple C++ KD-Tree implementation

License

Notifications You must be signed in to change notification settings

walaj/KDTree

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

21 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

KDTree

Simple C++ static KD-Tree implementation with minimal functionality.

  • points are given as STL vectors (and inserted in their own STL vector) so supports n-dimensional points for any n
  • makes full trees, (i.e. does not cut-off the branching at some arbitrary level) giving the nearest neighbor query have (strong) logarithmic complexity.
  • builds the tree in one go (does not support adding nodes, the tree is built from a list of points and cannot be altered afterwards)
  • points are assumed to be STL vectors
  • it provides the following queries:
    • nearest neighbor
    • neighbors within a given distance

License and copyright

© J. Frederico Carvalho Licensed under the BSD3 License

About

Simple C++ KD-Tree implementation

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • C++ 91.1%
  • CMake 7.1%
  • Makefile 1.8%