TY - JOUR

T1 - Hausdorff distance under translation for points and balls

AU - Agarwal, Pankaj K.

AU - Har-Peled, Sariel

AU - Sharir, Micha

AU - Wang, Yusu

PY - 2010/8/1

Y1 - 2010/8/1

N2 - We study the shape matching problem under the Hausdorff distance and its variants. In the first part of the article, we consider two sets A, B of balls in Rd, d = 2, 3, andwishtofind 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 translations t (as is the standard approach), or consider only translations that keep the balls of Α + t disjoint from those of Β. We propose several exact and approximation algorithms for these problems. In the second part of the article, we note that the Hausdorff distance is sensitive to outliers, and thus consider two variants that are more robust: the root-mean-square (rms) and the summed Hausdorff distance. We propose ef?cient approximation algorithms for computing the minimum rms and the minimum summed Hausdorff distances under translation, between two point sets in ℝd .Inorder to obtain a fast algorithm for the summed Hausdorff distance, we propose a deterministic ef?cient dynamic data structure for maintaining an ε-approximation of the 1-median of a set of points in ℝd, under insertions and deletions.

AB - We study the shape matching problem under the Hausdorff distance and its variants. In the first part of the article, we consider two sets A, B of balls in Rd, d = 2, 3, andwishtofind 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 translations t (as is the standard approach), or consider only translations that keep the balls of Α + t disjoint from those of Β. We propose several exact and approximation algorithms for these problems. In the second part of the article, we note that the Hausdorff distance is sensitive to outliers, and thus consider two variants that are more robust: the root-mean-square (rms) and the summed Hausdorff distance. We propose ef?cient approximation algorithms for computing the minimum rms and the minimum summed Hausdorff distances under translation, between two point sets in ℝd .Inorder to obtain a fast algorithm for the summed Hausdorff distance, we propose a deterministic ef?cient dynamic data structure for maintaining an ε-approximation of the 1-median of a set of points in ℝd, under insertions and deletions.

KW - Algorithms

KW - Theory

UR - http://www.scopus.com/inward/record.url?scp=77956556230&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77956556230&partnerID=8YFLogxK

U2 - 10.1145/1824777.1824791

DO - 10.1145/1824777.1824791

M3 - Article

AN - SCOPUS:77956556230

VL - 6

JO - ACM Transactions on Algorithms

JF - ACM Transactions on Algorithms

SN - 1549-6325

IS - 4

M1 - 71

ER -