scientific article
From MaRDI portal
Publication:2921659
zbMath1297.68246MaRDI QIDQ2921659
Shmuel Safra, Christos H. Papadimitriou
Publication date: 13 October 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Computational aspects of the Gromov-Hausdorff distance and its application in non-rigid shape matching ⋮ The parameterized complexity of geometric graph isomorphism ⋮ On the parameterized complexity of \(d\)-dimensional point set pattern matching ⋮ 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 ⋮ The generic combinatorial algorithm for image matching with classes of projective transformations ⋮ New complexity bounds for image matching under rotation and scaling ⋮ Inapproximability for metric embeddings into $\mathbb{R}^{d}$ ⋮ The exact complexity of projective image matching ⋮ 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 ⋮ Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces
