Build KD-Trees and perform Nearest Neighbor searches
-
Updated
Mar 16, 2017 - C++
Build KD-Trees and perform Nearest Neighbor searches
Object Detection pipeline implemented using the Voxel Grid and ROI based filtering, 3D RANSAC segmentation, Euclidean clustering based on KD-Tree, and bounding boxes, by processing Point Cloud data from LiDAR sensor.
An optimized, single-header kD-Tree library for points written in C++11.
Algorithms implemented by me for the course "Advanced Algorithms" (J. Cnops) at the Ghent University (Master of Science in Industrial Engineering: Information Science)
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."