Approximate Minimum-Weight Matching with Outliers under Translation

Published: Oct 24, 2018
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_pnorm of the tuple of the Euclidean distances between the pairs of matched points, for...
Paper Details
Title
Approximate Minimum-Weight Matching with Outliers under Translation
Published Date
Oct 24, 2018
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.