The complexity of low-distortion embeddings between point sets
From MaRDI portal
Cited in
(20)- A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation
- A divide-and-conquer strategy for embedding a distance-net point set into \(E^ n\) and its application
- The generic combinatorial algorithm for image matching with classes of projective transformations
- Low-dimensional pinned distance sets via spherical averages
- Computational aspects of the Gromov-Hausdorff distance and its application in non-rigid shape matching
- On the parameterized complexity of \(d\)-dimensional point set pattern matching
- Approximation algorithms for low-distortion embeddings into low-dimensional spaces
- Inapproximability for metric embeddings into $\mathbb{R}^{d}$
- The parameterized complexity of geometric graph isomorphism
- Approximation algorithms for low-distortion embeddings into low-dimensional spaces
- Two-Dimensional Pattern Matching with Combined Scaling and Rotation
- Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs
- Low distortion maps between point sets
- Low Distortion Maps Between Point Sets
- New Complexity Bounds for Image Matching under Rotation and Scaling
- FPT Algorithms for Embedding into Low-Complexity Graphic Metrics
- Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces
- New complexity bounds for image matching under rotation and scaling
- Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
- The exact complexity of projective image matching
This page was built for publication: The complexity of low-distortion embeddings between point sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921659)
