BETAmodules.com is in beta — open to partnerships & joint ventures.Build with us
modules.com
⌘K

kabsch_umeyama

v0.1.2crates.io· Rust

The 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.

The verdict
Abandoned. Last published over a year ago. No recent activity — look for a maintained alternative.
No recent activity — look for a maintained alternative.
Live from the crates.io registry · derived rules, not AI
How it scores
MaintenanceAbandoned
PopularityNiche
SecurityClean
LicensePermissive
DepsZero deps
Maintenance
Last published over a year ago.
Popularity
1 downloads / week
Security
No known advisories for this version (OSV).
License
Apache-2.0
Dependencies
No runtime dependencies
Recent releases
  • 0.1.2over a year ago
  • 0.1.1over a year ago
  • 0.1.0over a year ago
kabsch_umeyama — The 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. (Rust / crates.io) — verdict, alternatives & security · Modules