# Hausdorff distance under translation for points and balls

Published

Journal Article

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 Rd. 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.

### Full Text

### Duke Authors

### Cited Authors

- Agarwal, PK; Har-Peled, S; Sharir, M; Wang, Y

### Published Date

- January 1, 2003

### Published In

- Proceedings of the Annual Symposium on Computational Geometry

### Start / End Page

- 282 - 291

### Digital Object Identifier (DOI)

- 10.1145/777833.777835

### Citation Source

- Scopus