## Geometric matching under noise: combinatorial bounds and algorithms (1999)

### Cached

### Download Links

- [www.cs.utah.edu]
- [palestrina.stanford.edu:8000]
- [www.cs.duke.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS |

Citations: | 40 - 9 self |

### BibTeX

@INPROCEEDINGS{Indyk99geometricmatching,

author = {Piotr Indyk and Rajeev Motwani and Suresh Venkatasubramanian},

title = {Geometric matching under noise: combinatorial bounds and algorithms},

booktitle = {ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS},

year = {1999},

pages = {457--465},

publisher = {Society for Industrial and Applied Mathematics}

}

### Years of Citing Articles

### OpenURL

### Abstract

In geometric pattern matching, we are given two sets of points P and Q in d dimensions, and the problem is to determine the rigid transformation that brings P closest to Q, under some distance measure. More generally, each point can be modelled as a ball of small radius, and we may wish to nd a transformation approximating the closest distance between P and Q. This problem has many applications in domains such as computer vision and computational chemistry In this paper we present improved algorithms for this problem, by allowing the running time of our algorithms to depend not only on n, (the number of points in the sets), but also on, the diameter of the point set. The dependence on also allows us to e ectively process point sets that occur in practice, where diameters tend to be small ([EVW94]). Our algorithms are also simple to implement, in contrast to much of the earlier work. To obtain the above-mentioned results, we introduce a novel discretization technique to reduce geometric pattern matching to combinatorial pattern matching. In addition, we address various generalizations of the classical problem rst posed by Erdos: \Given a set of n points in the plane, how many pairs of points can be exactly a unit distance apart?". The combinatorial bounds we prove enable us to obtain improved results for geometric pattern matching and may have other applications.