kabsch_umeyama
v0.1.2 GrowingThe Kabsch-Umeyama algorithm is a method for aligning and comparing the similarity between two sets of points. It finds the optimal translation, rotation and scaling by minimizing the root-mean-square deviation (RMSD) of the point pairs.
Quick Verdict
- ✕Not updated for 1+ year
- !Pre-1.0: API may have breaking changes
- ✓Tiny footprint (8KB, 2 deps)
- ✓Permissive license (Apache-2.0)
Security
Deep Insights
8 downloads in the last 30 days (0/day avg).
Despite being 1+ years old, kabsch_umeyama hasn't reached 1.0 yet. Expect potential API changes between versions.
Only 2 direct dependencies. Lean dependency tree means faster builds and lower supply chain risk.
At 8KB, kabsch_umeyama is lightweight. Small crate size correlates with focused, well-scoped functionality.
Health Breakdown
Recency, release consistency, active ratio
Yanked ratio, deps, size, maturity, features
Reverse deps, ownership, ecosystem
Downloads, momentum, growth trend
Docs, repo, license, metadata
