Abstract
An algorithm is given which, in time O( n log n), determines all the Euclidean congruences (if any) between two n-point sets in 3-dimensional space. The algorithm is shown to be optimal to within a constant factor.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have