Point Set pattern matching ind-dimensions

Abstract

In this paper we apply computational geometry techniques to obtain an efficient algorithm for the following point set pattern matching problem. Given a setS ofn points and a setP ofk points in thed-dimensional Euclidean space, determine whetherP matches anyk-subset ofS, where a match can be any similarity, i.e., the setP is allowed to undergo translation, rotation, reflection, and global scaling. Motivated by the need to traverse the sets in an orderly fashion to shun exponential complexity, we circumvent the lack of a total order for points in high-dimensional spaces by using an extension of one-dimensional sorting to higher dimensions (which we call “circular sorting”). This mechanism enables us to achieve the orderly traversal we sought. An optimal algorithm (in time and space) is described for performing circular sorting in arbitrary dimensions. The time complexity of the resulting algorithm for point set pattern matching is O(n logn+kn) for dimension one and O(kn^d) for dimensiond≥2.