Absolute balanced kdtree for fast kNN search.

An easy to follow library to make Fortran easier in general with wrapped interfaces, sorting routines, kD-Trees, and other algorithms to handle scientific data and concepts. The library contains core fortran routines and object-oriented classes.

Simple kdtree library in erlang

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.

Build KD-Trees and perform Nearest Neighbor searches

A simple and fast KD-tree for points in Python for kNN or nearest points. (damm short at just ~60 lines) No libraries needed.

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.

An optimized, single-header kD-Tree library for points written in C++11.

GeoNames REST API

use OpenCL implement the KDTree

Ruby implementation of space partitioning tree

A 2D k-dimensional tree implementation with Java

Algorithms implemented by me for the course "Advanced Algorithms" (J. Cnops) at the Ghent University (Master of Science in Industrial Engineering: Information Science)

Java code to visualize trees (e.g., BST, BTree, QuadTree)

KD-tree with RGB colors

Finding nearest city to a position in android using k-d trees

A) Convex Hull 2D-3D Algorithms B) KD-Trees, Orthogonal Search, Voronoi Diagrams, Delaunay Triangulation

Implementation of KD Trees using scikit learn library for information retrieval.

A Package for extrapolating Pincode from Lat Longs