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
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
A simple Cython/C quadtree implementation
This repository contains multiple solutions for the knapsack-problem.
Extremely Simple Neighbor Particle Search Tree
quitefastmst: Euclidean and Mutual Reachability Minimum Spanning Trees
Leverage computer vision with YOLO and Roboflow to implement clothing recognition and develop a recommendation app for outfit suggestions.
DataPilot is a web app for visualizing 3D data using K-means and Nearest Neighbor algorithms. Built with Streamlit, it features from-scratch Python implementations and interactive 3D plots with Plotly.
Simulation Tools and Techniques - Project - Traveling Umpire Problem
Add a description, image, and links to the neighbor-search topic page so that developers can more easily learn about it.
To associate your repository with the neighbor-search topic, visit your repo's landing page and select "manage topics."