Kdtree-for-Nearest-Neighbour-Search

Use a KD-tree to perform nearest neighbor search on a point cloud.

Main.cpp includes two test cases: One with a bin point cloud file, and other with a custom 2D point cloud.

Build

g++ -o main main.cpp

Name		Name	Last commit message	Last commit date
Latest commit History 18 Commits
README.md		README.md
compare.h		compare.h
kdnode.h		kdnode.h
kdtree.h		kdtree.h
main		main
main.cpp		main.cpp
point.h		point.h
pointcloud.h		pointcloud.h
test_bin.bin		test_bin.bin