Approximate minimum-weight matching with outliers under translation

Pankaj K. Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, Günter Rote, Micha Sharir, Allen Xiao

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Our goal is to compare two planar point sets by finding subsets of a given size such that a minimum-weight matching between them has the smallest weight. This can be done by a translation of one set that minimizes the weight of the matching. We give efficient algorithms (a) for finding approximately optimal matchings, when the cost of a matching is the Lp-norm of the tuple of the Euclidean distances between the pairs of matched points, for any p ∈ [1,∞], and (b) for constructing small-size approximate minimization (or matching) diagrams: partitions of the translation space into regions, together with an approximate optimal matching for each region.

Original languageEnglish
Title of host publication29th International Symposium on Algorithms and Computation, ISAAC 2018
EditorsChung-Shou Liao, Der-Tsai Lee, Wen-Lian Hsu
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages26:1-26:13
ISBN (Electronic)9783959770941
DOIs
StatePublished - 1 Dec 2018
Event29th International Symposium on Algorithms and Computation, ISAAC 2018 - Jiaoxi, Yilan, Taiwan, Province of China
Duration: 16 Dec 201819 Dec 2018

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume123
ISSN (Print)1868-8969

Conference

Conference29th International Symposium on Algorithms and Computation, ISAAC 2018
Country/TerritoryTaiwan, Province of China
CityJiaoxi, Yilan
Period16/12/1819/12/18

Keywords

  • Approximation
  • Minimum-weight partial matching
  • Pattern matching

Fingerprint

Dive into the research topics of 'Approximate minimum-weight matching with outliers under translation'. Together they form a unique fingerprint.

Cite this