License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ISAAC.2018.26
URN: urn:nbn:de:0030-drops-99747
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9974/
Agarwal, Pankaj K. ;
Kaplan, Haim ;
Kipper, Geva ;
Mulzer, Wolfgang ;
Rote, Günter ;
Sharir, Micha ;
Xiao, Allen
Approximate Minimum-Weight Matching with Outliers Under Translation
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 L_p-norm of the tuple of the Euclidean distances between the pairs of matched points, for any p in [1,infty], 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.
BibTeX - Entry
@InProceedings{agarwal_et_al:LIPIcs:2018:9974,
author = {Pankaj K. Agarwal and Haim Kaplan and Geva Kipper and Wolfgang Mulzer and G{\"u}nter Rote and Micha Sharir and Allen Xiao},
title = {{Approximate Minimum-Weight Matching with Outliers Under Translation}},
booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)},
pages = {26:1--26:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-094-1},
ISSN = {1868-8969},
year = {2018},
volume = {123},
editor = {Wen-Lian Hsu and Der-Tsai Lee and Chung-Shou Liao},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9974},
URN = {urn:nbn:de:0030-drops-99747},
doi = {10.4230/LIPIcs.ISAAC.2018.26},
annote = {Keywords: Minimum-weight partial matching, Pattern matching, Approximation}
}
Keywords: |
|
Minimum-weight partial matching, Pattern matching, Approximation |
Collection: |
|
29th International Symposium on Algorithms and Computation (ISAAC 2018) |
Issue Date: |
|
2018 |
Date of publication: |
|
06.12.2018 |