An optimal algorithm for geometrical congruence

DOI10.1016/0196-6774(87)90036-8zbMath0618.68041OpenAlexW2079909954MaRDI QIDQ4728246

No author found.

Publication date: 1987

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(87)90036-8

zbMATH Keywords

3-dimensional spaceEuclidean congruences

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (9)

Point set pattern matching in \(d\)-dimensions ⋮ On determining the congruence of point sets in \(d\) dimensions ⋮ Linear time algorithms for testing approximate congruence in the plane ⋮ Testing congruence and symmetry for general 3-dimensional objects. ⋮ New error measures and methods for realizing protein graphs from distance data ⋮ On similarity of polynomial configurations ⋮ Simple algorithms for partial point set pattern matching under rigid motion ⋮ ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES ⋮ Congruence, similarity, and symmetries of geometric objects

This page was built for publication: An optimal algorithm for geometrical congruence