Partial-matching RMS distance under translation: combinatorics and algorithms

DOI10.1007/s00453-017-0326-0zbMath1392.68424OpenAlexW2624507311MaRDI QIDQ724243

Rafel Jaume, Balázs Keszegh, Orit E. Raz, Micha Sharir, Igor Tubis, Rinat Ben-Avraham, Matthias Schymura

Publication date: 25 July 2018

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: http://real.mtak.hu/71242/1/1411.7273v1.pdf

zbMATH Keywords

local minimumpartial matchingshape matchingconvex subdivisionRMS distance

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Counting houses of Pareto optimal matchings in the house allocation problem
• Long monotone paths in line arrangements
• Applications of random sampling in computational geometry. II
• On cores and indivisibility
• Monotone Paths in Planar Convex Subdivisions and Polytopes
• Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
• Fibonacci heaps and their uses in improved network optimization algorithms

This page was built for publication: Partial-matching RMS distance under translation: combinatorics and algorithms