umeyama 0.1.0

An algorithm for finding the optimal translation, rotation, and scaling that aligns two sets of points with minimum root-mean-square deviation (RMSD).
Documentation
  • Coverage
  • 50%
    1 out of 2 items documented0 out of 1 items with examples
  • Size
  • Source code size: 10.38 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 1.24 MB This is the summed size of all files generated by rustdoc for all configured targets
  • Ø build duration
  • this release: 58s Average build duration of successful builds.
  • all releases: 58s Average build duration of successful builds in releases after 2024-10-23.
  • Links
  • Homepage
  • xclud/rust-umeyama
    1 0 0
  • crates.io
  • Dependencies
  • Versions
  • Owners
  • xclud

Umeyama

The Kabsch-Umeyama algorithm is a method for finding the optimal translation, rotation, and scaling that aligns two sets of points with minimum root-mean-square deviation (RMSD). It is named after Wolfgang Kabsch and Shinji Umeyama, who independently developed the algorithm for different applications. It is useful for comparing molecular and protein structures, point-set registration, and physics simulation.

Some of the main steps of the algorithm are:

  • Calculate the centroids of the two sets of points and translate them to the origin.
  • Compute the covariance matrix of the translated points and perform singular value decomposition on it.
  • Determine the optimal rotation matrix and scale factor using the singular values and the sign of the determinant of the orthogonal matrices.
  • Apply the translation, rotation, and scaling to the second set of points to align it with the first set.