A simple and fast python library to handle the data generated from molecular dynamics simulations
Python wrapper around C++ utilities for computing neighbors and local geometric features of a point cloud
FAISS library compiled for iOS, macOS, tvOS, watchOS
C++ library for fast computation of neighbor lists in point clouds.
Fast, accurate, fully tested geohashing library for Swift
vectorization of the kd-tree data structure and search algorithm
A Fortran implementation of KD-Tree searching
A Fortran octree implementation
High-performance, multithreaded C++ library with a Python interface designed for the rapid visualization of Smoothed Particle Hydrodynamics (SPH) simulations.
The algorithm helps to automatically arrange high school timetables for students and teachers. This is an algorithm implemented to support the scientific article of graduate student Nguyen Ho Thien Dang and Ph.D. Phan Tan Quoc.
Real-time fluid simulation using smoothed particle hydrodynamics (SPH) by taking advantage of GPU hardware ray tracing for particle neighbor search.
TSP applied in maps of The Legend of Zelda: BOTW.
Octree construction on GPUs based on Hilbert curves
Crime Database which shows a walkthrough of the Criminal Activities that happened around Your Neighborhood in the past. Also a safety application for women with SOS Feature, Exit, Action Plans when Stuck in a Situation using AI
command line program for splitting roads to service area or distance categories, neighboring points on network identification, structure to road access distance evaluation
quitefastmst: Euclidean and Mutual Reachability Minimum Spanning Trees
Implementation from truly spatial random forest paper
Matrix Ordering of 3D Point Clouds for Performance Improvement in Neighbor Searching through Bounding
A simple Cython/C quadtree implementation
To associate your repository with the neighbor-search topic, visit your repo's landing page and select "manage topics."