An easy-to-use Python library for processing and manipulating 3D point clouds and meshes.
-
Updated
Feb 13, 2024 - C++
An easy-to-use Python library for processing and manipulating 3D point clouds and meshes.
Nearest Neighbor Search with Neighborhood Graph and Tree for High-dimensional Data
Performance-portable geometric search library
Python wrapper around C++ utility to compute local geometric features of a point cloud
A framework for building (and incrementally growing) graph-based data structures used in hierarchical or DAG-structured clustering and nearest neighbor search
Performance comparison of the MRPT algorithm to other approximate nearest neighbor search libraries
Network diffusion algorithms in R.
R package wrapping libnabo: fast K Nearest Neighbor search for low dimensions
C++ Vantage Point Tree implementation with Python bindings
C++/Python implementation of Nearest Neighbor Descent for efficient approximate nearest neighbor search
RRT, RRT* algorithms and a visualizer of these algorithms.
Nearest neighbor search. Methods: LSH, hypercube, and exhaustive search. C++
X-tree data structure in c++ for high dimensional data indexing
Fast Adaptive Similarity Search through Variance‑Aware Quantization
Another fast exact and approximate nearest neighbor toolbox for R.
Build KD-Trees and perform Nearest Neighbor searches
LSH and Hypercube algorithms for Approximate Nearest Neighbor. Centroid based clustering using Lloyd's and reverse assignment algorithms.
Example-based Image Synthesis
Python package providing nearest neighbor search (wraps ANN library)
Add a description, image, and links to the nearest-neighbors topic page so that developers can more easily learn about it.
To associate your repository with the nearest-neighbors topic, visit your repo's landing page and select "manage topics."