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

DOI10.1007/978-3-662-44777-2_9zbMath1423.68538arXiv1411.7273OpenAlexW1772924567MaRDI QIDQ2921397

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

Publication date: 8 October 2014

Published in: Algorithms - ESA 2014 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.7273

zbMATH Keywords

local minimumpolyhedral subdivisionpartial matchingHausdorff RMS-distance

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (7)

Bipartite diameter and other measures under translation ⋮ Set systems related to a house allocation problem ⋮ Bottleneck partial-matching Voronoi diagrams and applications ⋮ Unnamed Item ⋮ Partial-matching RMS distance under translation: combinatorics and algorithms ⋮ Counting houses of Pareto optimal matchings in the house allocation problem ⋮ Small candidate set for translational pattern search

This page was built for publication: Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms