12 packages tagged with “KDTree”
Generic multi-dimensional binary search tree.
A fast static index for 2D points for dotnet
This is an extremely-fast and easy to use KDTree written entirely in modern C#. This is the fastest and simplest to use KDTree that I have been able to find for .NET. The project has thorough documentation and is open-source. This module is a part of the larger Supercluster project. Tutorials and Wiki: https://github.com/MathFerret1013/Supercluster.KDTree/wiki MSDN Style Docs: http://mathferret1013.github.io/Supercluster.KDTree GitHub: https://github.com/MathFerret1013/Supercluster.KDTree
Package Description
A Simple .NET Implementation of a KDTree for Nearest Neighbours searches with performances in mind.
A .NET standard library to work with spatial types, structures and algorithms (GeoJson, Geometry, KdTree, RTree, Delaunay, Simplification, etc.)
.NET implementations of common spatial indexing structures such as binary space partioning trees.
A high-performance, generalized K-D Tree implementation for fast spatial searches.
a C# library that provides an efficient way to cluster large point datasets. This library is based on the popular Supercluster JavaScript library by Mapbox and has been optimized for performance in .NET environments.
Fast 2D DBSCAN clustering with KD-Tree acceleration in pure C#.
Spatial data structures (QuadTree, KDTree, SpatialHashGrid) for Omni.Collections
Interfaces and types for large collections that can store up to 1_152_921_504_606_846_976 items including arrays, lists, sets, dictionaries, and spatial trees (KDTree, BKDTree, B+Tree). Many .NET standard collections are limited to about 2.1 billion items.