pICP: plain Iterative Closest Point, a no-frills implementation in C++ of a simple rigid 3D registration algorithm. Easy to integrate, uses minimal dependencies.
-
Updated
Apr 11, 2020 - C++
pICP: plain Iterative Closest Point, a no-frills implementation in C++ of a simple rigid 3D registration algorithm. Easy to integrate, uses minimal dependencies.
Fast algorithms on 2 dimensional rigidity and (k,l)-sparsity matroids. M-component hypergraph, transversal on the MCT sets and redundant augmentation in O(|V|^2) time and O(|V|) memory.
Pure Numpy Implementation of the Landmark-Guided Coherent Point Drift Algorithm
Winkler Model of the rigid plate system
Add a description, image, and links to the rigid topic page so that developers can more easily learn about it.
To associate your repository with the rigid topic, visit your repo's landing page and select "manage topics."