Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms

Ben-Avraham, Rinat and Henze, Matthias and Jaume, Rafel and Keszegh, Balázs and Raz, Orit E. and Sharir, Micha and Tubis, Igor (2014) Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms. Algorithms - ESA 2014 Lecture Notes in Computer Science, 8737. pp. 100-111. ISSN 0302-9743

Preview

Text esa2014_edit10.pdf Download (343kB) | Preview

Abstract

We consider the RMS-distance (sum of squared distances between pairs of points) under translation between two point sets in the plane. In the Hausdorff setup, each point is paired to its nearest neighbor in the other set. We develop algorithms for finding a local minimum in near-linear time on the line, and in nearly quadratic time in the plane. These improve substantially the worst-case behavior of the popular ICP heuristics for solving this problem. In the partial-matching setup, each point in the smaller set is matched to a distinct point in the bigger set. Although the problem is not known to be polynomial, we establish several structural properties of the underlying subdivision of the plane and derive improved bounds on its complexity. In addition, we show how to compute a local minimum of the partial-matching RMS-distance under translation, in polynomial time.

Actions (login required)

Edit Item