jlblancoc/nanoflann
nanoflann: a C++11 header-only library for Nearest Neighbor (NN) search with KD-trees observed · 2026-08-28
Health v2 · maintenance only
94/100
- Activity 99
- Release rhythm 84
- Longevity 100
Flags: no_license
How is this computed?
round(0.45*activity + 0.35*rhythm + 0.20*longevity); archived -> min(score, 10) — computed 2026-09-03. Adoption (stars, forks) is never an input.
- gap_med: 40
- age_days: 4507
- days_rel: 25
- days_push: 8
- n_releases_24m: 10
Adoption not part of the score
2670 stars · 525 forks observed · 2026-08-28
What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded
nanoflann is a C++11 header-only library for fast nearest neighbor search using KD-trees. It is designed for efficient queries over point clouds and high-dimensional datasets without external dependencies.
Use cases
- find nearest neighbors in a point cloud
- kdtree search in C++ without dependencies
- fast kNN queries for 3D point data
- nearest neighbor search for robotics SLAM
- header-only spatial indexing library
- approximate and exact k-nearest-neighbor lookup
When to choose
- you need a lightweight, header-only C++ nearest neighbor library
- you work with point clouds or high-dimensional numeric data
- you want zero external dependencies and easy integration
When to avoid
- you need GPU-accelerated or distributed nearest neighbor search
- you need a full linear algebra or geometry processing library
- your data is non-numeric or requires custom distance metrics beyond supported ones
Facets
library · maturity stable
search-engine math developer-tools computer-vision robotics performance cpp cross-platform windows header-only kd-trees nearest-neighbor point-clouds c-plus-plus algorithms linux macos
1 source
- readme: https://github.com/jlblancoc/nanoflann · fetched 2026-08-28 · c92cbd2d26c2
Member repositories
| Repository | Role | Health v2 |
|---|---|---|
| jlblancoc/nanoflann | main | 94 |
For agents
markdown · JSON · MCP: product_card(name="jlblancoc/nanoflann")
Data as of 2026-08-30T08:39:29.467469+00:00 · Report a problem