Summary: Pattern Matching for Spatial Point Sets

David E. Cardoze
Leonard J. Schulman
College of Computing
Georgia Institute of Technology
Atlanta GA 30332-0280¡
cardoze, schulman¢ @cc.gatech.edu
Abstract
Two sets of points in £ -dimensional space are given: a
data set ¤ consisting of ¥ points, and a pattern set or probe
¦ consisting of § points. We address the problem of deter-
mining whether there is a transformation, among a specified
group of transformations of the space, carrying
¦ into or
near (meaning at a small directed Hausdorff distance of) ¤ .
The groups we consider are translations and rigid motions.
Runtimes of approximately ¨© log and ¨© log re-
spectively are obtained (letting max¥!"§$# and omit-
ting the effects of several secondary parameters). For trans-

Source: Abu-Mostafa, Yaser S. - Department of Mechanical Engineering & Computer Science Department, California Institute of Technology

Collections: Computer Technologies and Information Sciences