TESTING THE CONGRUENCE OF d-DIMENSIONAL POINT SETS

DOI10.1142/S0218195902000761zbMath1152.68658OpenAlexW2113441114MaRDI QIDQ4818548

Christian Knauer, Peter Brass

Publication date: 29 September 2004

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195902000761

zbMATH Keywords

symmetrycongruencecomputational geometryshape matching

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (3)

The parameterized complexity of geometric graph isomorphism ⋮ On the parameterized complexity of \(d\)-dimensional point set pattern matching ⋮ Simple algorithms for partial point set pattern matching under rigid motion

This page was built for publication: TESTING THE CONGRUENCE OF d-DIMENSIONAL POINT SETS