An optimal algorithm for geometrical congruence
Journal of Algorithms
Congruence, similarity and symmetries of geometric objects
Discrete & Computational Geometry - ACM Symposium on Computational Geometry, Waterloo
Two algorithms for nearest-neighbor search in high dimensions
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
Approximating the bandwidth via volume respecting embeddings
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Competitive concurrent distributed queuing
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Lectures on Discrete Geometry
Shape Matching and Object Recognition Using Shape Contexts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Point matching under non-uniform distortions
Discrete Applied Mathematics - Special issue: Computational molecular biology series issue IV
An Algorithmic Theory of Learning: Robust Concepts and Random Projection
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Algorithmic Applications of Low-Distortion Geometric Embeddings
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Low distortion maps between point sets
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
On bending invariant signatures for surfaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
Low-distortion embeddings of general metrics into the line
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Embedding ultrametrics into low-dimensional spaces
Proceedings of the twenty-second annual symposium on Computational geometry
Approximation algorithms for embedding general metrics into trees
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On the parameterized complexity of d-dimensional point set pattern matching
Information Processing Letters
Circular partitions with applications to visualization and embeddings
Proceedings of the twenty-fourth annual symposium on Computational geometry
Improved algorithms for optimal embeddings
ACM Transactions on Algorithms (TALG)
Two-Dimensional Pattern Matching with Combined Scaling and Rotation
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Hardness of Embedding Metric Spaces of Equal Size
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
New Complexity Bounds for Image Matching under Rotation and Scaling
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Theoretical Computer Science
On the complexity of affine image matching
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Inapproximability for planar embedding problems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
New complexity bounds for image matching under rotation and scaling
Journal of Discrete Algorithms
Theoretical Computer Science
Low Distortion Maps Between Point Sets
SIAM Journal on Computing
On the hardness of embeddings between two finite metrics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
On the parameterized complexity of d-dimensional point set pattern matching
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
| Hi-index | 0.02 |
We prove that it is NP-hard to approximate by a ratio better than 3 the minimum distortion of a bijection between two given finite three-dimensional sets of points.