Skip to content

Finding the nearest neighbor for 3d points in KD tree. Two implementations: nn.cpp (CPU) and nn.cu (CUDA GPU).

Notifications You must be signed in to change notification settings

lkawka/3d-nearest-neighbor-search-in-kd-tree-cuda

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 

Repository files navigation

3d nearest neighbor search in kd-tree with CUDA

The goal of a project is to compare the performance of CPU (nn.cpp) and CUDA GPU (nn.cu) implementations of the same problem. Both solutions find the nearest neighbor for one million query points in the kd-tree consisting of 10000 3 dimensional points.

To compile and run both implementations, use the run.sh script.

About

Finding the nearest neighbor for 3d points in KD tree. Two implementations: nn.cpp (CPU) and nn.cu (CUDA GPU).

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published