Absolute balanced kdtree for fast kNN search.
-
Updated
Sep 13, 2023 - C
Absolute balanced kdtree for fast kNN search.
Project related to the course "Foundations of High Performance Computing" of the Master's Degree in Computational Science and Engineering @ UniTS. The purpose of this assignment is to develop both OpenMP and MPI versions of a program that builds a kdtree.
Add a description, image, and links to the kdtrees topic page so that developers can more easily learn about it.
To associate your repository with the kdtrees topic, visit your repo's landing page and select "manage topics."