Fast Incremental Euclidean Distance Fields for Online Motion Planning of Aerial Robots
-
Updated
Sep 10, 2019 - C++
Fast Incremental Euclidean Distance Fields for Online Motion Planning of Aerial Robots
This project consists in the implementation of the K-Means and Mini-Batch K-Means clustering algorithms. This is not to be considered as the final and most efficient algorithm implementation as the objective here is to make a clear comparison between the sequential and parallel execution of the clustering steps.
The MongoDB Database with image similarity functions
Classic k-means using euclidean distance in C++
Add a description, image, and links to the euclidean-distances topic page so that developers can more easily learn about it.
To associate your repository with the euclidean-distances topic, visit your repo's landing page and select "manage topics."