I'm looking for an algorithm to determine if two "clouds" of points in space are superimposable or not. There are efficient ways to do that with matrix algebra, see here:
http://nghiaho.com/?page_id=671
The problem I'm having is that my datapoints are not (and cannot be) ordered, as the above algorithm assumes, but really are sets of points in 3D. The only way would be to try every possible ordering...
You can try to order the points according to their squared distance to the centroid.
You can have a look at this page. The ICP algorithm or its variants are often used.
https://en.wikipedia.org/wiki/Point_set_registration
David Vega, thank you. Using the distances from each cloud's centroid, or the radial distribution function, I was able to figure it out.
- Badges
- Science topic
- Similar topics
- Mathematics
- Algebra
- Matrix