Title :
Pattern matching for spatial point sets
Author :
Cardoze, David E. ; Schulman, Leonard J.
Author_Institution :
Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA
Abstract :
Two sets of points in d-dimensional space are given: a data set D consisting of N points, and a pattern set or probe P consisting of k points. We address the problem of determining whether there is a transformation, among a specified group of transformations of the space, carrying P into or near (meaning at a small directed Hausdorff distance of) D. The groups we consider are translations and rigid motions. Runtimes of approximately O(nlogn) and O(ndlogn) respectively are obtained (letting n=max{N,k} and omitting the effects of several secondary parameters). For translations, a runtime of approximately O(n(ak+1)log2n) is obtained for the case that a constant fraction α<1 of the points of the probe is allowed to fail to match
Keywords :
computational geometry; pattern matching; d-dimensional space; directed Hausdorff distance; pattern matching; rigid motions; spatial point sets; Constellation diagram; Educational institutions; Electrical capacitance tomography; Electronic switching systems; Pattern matching; Probes; Runtime; Space technology;
Conference_Titel :
Foundations of Computer Science, 1998. Proceedings. 39th Annual Symposium on
Conference_Location :
Palo Alto, CA
Print_ISBN :
0-8186-9172-7
DOI :
10.1109/SFCS.1998.743439