Implementation of moving least squares
Project description
MoLeSq
Pronounced like "mollusc".
A python implementation of the Moving Least Squares algorithm for transforming sets of points from one space to another, as published in Schaefer et al. (2006).
Repackaged from implementation by Casey Schneider-Mizell.
Usage
Control points and points of interest are given as numpy arrays.
from molesq import Transformer
tran = Transformer(my_control_points, my_deformed_control_points)
deformed = tran.transform(my_points_of_interest)
undeformed = tran.transform(deformed, inverse=True)
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
molesq-0.1.0.tar.gz
(107.7 kB
view details)
File details
Details for the file molesq-0.1.0.tar.gz.
File metadata
- Download URL: molesq-0.1.0.tar.gz
- Upload date:
- Size: 107.7 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/3.4.1 importlib_metadata/3.10.0 pkginfo/1.7.0 requests/2.25.1 requests-toolbelt/0.9.1 tqdm/4.60.0 CPython/3.9.4
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | b77f0b903ba8dd995002e064a5e3fc5183f00dd7ccfd3bf7dc1e639683087461 |
|
| MD5 | 7706c41121e923e8a34d1c6c64d74226 |
|
| BLAKE2b-256 | 40e034392802fc40dd70a9335cb1451ed3a07f198d967743df31979798c10623 |
