## Abstract

Let A and B be two sets of n objects in R^{d}. We propose to use bottleneck matching as a convenient way for measuring the resemblance between them, and present several algorithms for computing, as well as approximating, this resemblance. The running time of all these algorithms is close to O(n^{1.5}). For instance, if the objects are points in the plane, the running time is O(n^{1.5} log n). We also consider the problem of finding a translation of B that maximizes the resemblance to A under the bottleneck matching criterion. When A and B are point-sets in the plane, we present an O(n^{5} log n) time algorithm for determining whether for some translated copy the resemblance gets below a given ρ, improving the previous result of Alt, Mehlhorn, Wagener and Welzl by a factor of almost n. We use this result to compute the smallest such ρ in time O(n^{5} log^{2} n), and give an efficient approximation scheme for this problem.

Original language | English (US) |
---|---|

Pages | 301-310 |

Number of pages | 10 |

DOIs | |

State | Published - Jan 1 1996 |

Externally published | Yes |

Event | Proceedings of the 1996 12th Annual Symposium on Computational Geometry - Philadelphia, PA, USA Duration: May 24 1996 → May 26 1996 |

### Other

Other | Proceedings of the 1996 12th Annual Symposium on Computational Geometry |
---|---|

City | Philadelphia, PA, USA |

Period | 5/24/96 → 5/26/96 |

## ASJC Scopus subject areas

- Theoretical Computer Science
- Geometry and Topology
- Computational Mathematics