An optimal algorithm for geometrical congruence

DOI10.1016/0196-6774(87)90036-8zbMATH Open0618.68041OpenAlexW2079909954MaRDI QIDQ4728246FDOQ4728246

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

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

zbMATH Keywords

3-dimensional spaceEuclidean congruences

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (13)

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

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)