mlsnd
| Crates.io | mlsnd |
| lib.rs | mlsnd |
| version | 0.1.1 |
| source | src |
| created_at | 2023-04-03 16:19:52.909061 |
| updated_at | 2023-04-03 17:01:17.581494 |
| description | Moving Least Squares deformations in N Dimensions |
| homepage | https://crates.io/mlsnd |
| repository | https://github.com/clbarnes/mlsnd |
| max_upload_size | |
| id | 829207 |
| size | 24,100 |
Chris Barnes (clbarnes)
documentation
https://docs.rs/mlsnd
README
mlsnd: Moving Least Squares in N Dimensions
An implementation of the moving least squares point deformation algorithm (Schaefer 2006).
Heavily inspired by the existing moving-least-squares crate. Here is how they compare:
| Feature | moving-least-squares |
mlsnd |
|---|---|---|
| Number types | f32 only | Generic over f32, f64 |
| Dimensionality | 2D only | Generic over N dimensions |
| Speed | ~20% faster | Slower |
| Algorithm support | Affine, rigid, similarity | Affine only |
| Dependencies | Fewer | More (mainly nalgebra) |
| Results (2D f32) | Same (near enough) | Same (near enough) |
The motivating paper only suggests a dimensionality-agnostic implementation for the affine case, although the other cases may be tractable for someone who is better than me at linear algebra.