Matching of 3D polygonal arcs
Douglas R. Heisterkamp, Prabir Bhatacharya · IEEE Transactions on Pattern Analysis and Machine Intelligence · 1997
We define a distance measure between 3D polygonal arcs of equal length, and show that the minimum value of this distance measure is the smallest eigenvalue of a certain matrix. Using this, we develop a mismatch measure and a matching algorithm for 3D polygonal arcs of unequal lengths.