## Abstract

We study the shape matching problem under the Hausdorff distance and its variants. Specifically, we consider two sets A, B of balls in ℝ^{d}, d = 2, 3, and wish to find a translation t that minimizes the Hausdorff distance between A + t, the set of all balls in A shifted by t, and B. We consider several variants of this problem. First, we extend the notion of Hausdorff distance from sets of points to sets of balls, so that each ball has to be matched with the nearest ball in the other set. We also consider the problem in the standard setting, by computing the Hausdorff distance between the unions of the two sets (as point sets). Second, we consider either all possible translates t (as is the standard approach), or consider only translations that keep the balls of A + t disjoint from those of B. We propose several exact and approximation algorithms for these problems. Since the Hausdorff distance is sensitive to outliers, we also propose efficient approximation algorithms for computing the minimum root-mean-square (rms) and the minimum summed Hausdorff distance, under translation, between two point sets in R^{d}. In order to obtain a fast algorithm for the summed Hausdorff distance, we propose a deterministic efficient dynamic data structure for maintaining an ε-approximation of the 1-median of a set of points, under insertion and deletion.

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

Pages | 282-291 |

Number of pages | 10 |

DOIs | |

State | Published - 2003 |

Event | Nineteenth Annual Symposium on Computational Geometry - san Diego, CA, United States Duration: Jun 8 2003 → Jun 10 2003 |

### Other

Other | Nineteenth Annual Symposium on Computational Geometry |
---|---|

Country/Territory | United States |

City | san Diego, CA |

Period | 6/8/03 → 6/10/03 |

## Keywords

- 1-median
- Hausdorff distance
- Shape matching
- Voronoi diagrams

## ASJC Scopus subject areas

- Theoretical Computer Science
- Geometry and Topology
- Computational Mathematics