Low distortion maps between point sets

DOI10.1145/1007352.1007398zbMath1192.68366OpenAlexW2078091066MaRDI QIDQ3580974

Yuval Rabani, Alistair Sinclair, Claire M. Kenyon

Publication date: 15 August 2010

Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1007352.1007398

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10) Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (11)

Two-Dimensional Pattern Matching with Combined Scaling and Rotation ⋮ Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs ⋮ Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs ⋮ New complexity bounds for image matching under rotation and scaling ⋮ An exact algorithm for minimum distortion embedding ⋮ Slightly Superexponential Parameterized Problems ⋮ Hardness and approximation of minimum distortion embeddings ⋮ Inapproximability for metric embeddings into $\mathbb{R}^{d}$ ⋮ Unnamed Item ⋮ New Complexity Bounds for Image Matching under Rotation and Scaling ⋮ A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation

This page was built for publication: Low distortion maps between point sets