Skip to content
/ 3d-nearest-neighbor-search-in-kd-tree-cuda Public
forked from lkawka/3d-nearest-neighbor-search-in-kd-tree-cuda

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

0 stars 5 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

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

BranchesTags
 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

117 Commits
README.md
README.md
 
 
nn.cpp
nn.cpp
 
 
nn.cu
nn.cu
 
 
run.sh
run.sh
 
 

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).

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages

  • Cuda 53.9%
  • C++ 44.7%
  • Shell 1.4%