An optimized, single-header kD-Tree library for points written in C++11.
-
Updated
Nov 30, 2017 - C++
An optimized, single-header kD-Tree library for points written in C++11.
Database Management Systems course projects
Library for a collection of commnly used data structures
update based on http://libkdtree.alioth.debian.org/
Sensor Fusion Nanodegree (Udacity) Projects.
Generic VPTree
KNN problem in Celestial Coordinates System & Angular Distance Metrics
Point Cloud processing (VoxelGrid Downsampling, RANSAC Segmentation, KDTree Euclidean Clustering) for obstacle detection for autonomous vehicles.
Collision detection for 3D shapes. Axis-aligned bounding boxes (AABB).
a super lightweight head-only 3d kdtree library based on nanoflann
KdTree implemented in Point Cloud
Use a KD-tree to perform the nearest neighbor search on a point cloud.
2D k-d tree implementation for counting points in a region
Implementations of different algorithms for building Euclidean minimum spanning tree in k-dimensional space.
Header-only C++ K-d tree library
Assignments done as part of UG Lab course
Add a description, image, and links to the kdtree topic page so that developers can more easily learn about it.
To associate your repository with the kdtree topic, visit your repo's landing page and select "manage topics."