An optimal algorithm for geometrical congruence

DOI10.1016/0196-6774(87)90036-8MaRDI QIDQ4728246zbMATH OpenOpenAlexFDO

Authors

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)

Recommendations

• TESTING THE CONGRUENCE OF d-DIMENSIONAL POINT SETS
• On determining the congruence of point sets in \(d\) dimensions
• Approximate decision algorithms for approximate congruence
• scientific article; zbMATH DE number 1555919
• Congruence, similarity, and symmetries of geometric objects

Cited in

(13)

• Approximate decision algorithms for approximate congruence
• On determining the congruence of point sets in \(d\) dimensions
• Testing congruence and symmetry for general 3-dimensional objects.
• Congruence, similarity, and symmetries of geometric objects
• Point set pattern matching in \(d\)-dimensions
• Simple algorithms for partial point set pattern matching under rigid motion
• scientific article; zbMATH DE number 1670651 (Why is no real title available?)
• An efficient algorithm to compute subsets of points in Z^n
• New error measures and methods for realizing protein graphs from distance data
• ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES
• Linear time algorithms for testing approximate congruence in the plane
• On similarity of polynomial configurations
• An n log n algorithm for determining the congruity of polyhedra

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4728246)