A point pattern matching algorithm

This paper presents an algorithm for finding a matching between two point patterns given in m-dimensional Euclidean space. The point pattern matching algorithm here is formulated as a tree search procedure, and the search tree is pruned by a specified tolerance measure for matching. The proposed method is based on the locations of points, and is invariant to rotation, translation, and scaling. Moreover, it is easy to use global geometric constraints, such as rotation or scaling parameters, in order to guide the search. [In Japanese.]