nanoflann:一个仅C++11头的库,用于使用KD树进行最近邻(NN)搜索
nanoflann 开源项目推荐(21 个)
nanoflann 话题在 GitHub 上没有填写简介,这里按 Star 数汇总最相关的热门仓库。
热门项目 前 20
按 Star 数排序展示前 20 个 · GitHub 共 21 个仓库An easy-to-use Python library for processing and manipulating 3D point clouds and meshes.
Python wrapper around C++ utilities for computing neighbors and local geometric features of a point cloud
Unofficial python wrapper to the nanoflann k-d tree
Performance comparison of NearestSearch and radiusSearch function in point cloud.
Implementation of Iterative Closest Point and Trimmed Iterative Closest Point algorithms.
RRT, RRT* algorithms and a visualizer of these algorithms.
My master's project
DBSCAN: faster evaluation using nanoflann's kdtree
nanoflann wrapper for python and maybe fortran
Bit-exact Rust port of nanoflann with Python bindings faster than SciPy's cKDTree
Density-peak clustering with path-density mutual-reachability merging. Sub-quadratic O(n log n) via a C++ pybind11/nanoflann kd-tree. 30× speedup at n=50k.
A simple yet effective approach to detecting visual anomalies
Hierarchiacal Motion Tracking algorithm based on ORB
js kdtree and flann lib benchmark
KNN: fast runtime performance using nanoflann's kdtree
nanoflann: a C++11 header-only library for Nearest Neighbor (NN) search wih KD-trees
A high-performance Python library for parallel k-NN search and IDW on scattered data, powered by a C++ core.
point-cloud registeration using Iterative closest point algorithm
hello world
关于这个话题
- 清单取自 GitHub 话题页并按 Star 数排序,每次展示前 20 个项目;原始页面见 https://github.com/topics/nanoflann。
- 该话题在 GitHub 上共有 21 个仓库, 本站收录的是其中最热门的 20 个,不是全量列表。
- Star / Fork 每日自动刷新一次,实时数据以 GitHub 为准。
- 当前 20 个项目累计 4452 Star,覆盖 4 种主要语言,数据更新于 2026-11-07。
- 中文介绍来自 GitHub 官方话题说明(github/explore)的机器翻译,可点「查看原文」对照;译文缺失时会先展示原文。