Testing the congruence of d-dimensional point sets
Proceedings of the sixteenth annual symposium on Computational geometry
On finding maximum-cardinality symmetric subsets
Computational Geometry: Theory and Applications - Special issue on Discrete and computational geometry
Computing Largest Common Point Sets under Approximate Congruence
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Simple algorithms for partial point set pattern matching under rigid motion
Pattern Recognition
On the parameterized complexity of d-dimensional point set pattern matching
Information Processing Letters
Applications of dimensionality reduction and exponential sums to graph automorphism
Theoretical Computer Science
On the parameterized complexity of d-dimensional point set pattern matching
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
A simple algorithm for approximate partial point set pattern matching under rigid motion
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
| Hi-index | 0.00 |