On determining the congruence of point sets in \(d\) dimensions

DOI10.1016/S0925-7721(97)00010-2zbMath0894.68156MaRDI QIDQ1384212

Tatsuya Akutsu

Publication date: 13 April 1998

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

randomized algorithmcongruencepattern matchingbirthday paradox

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

The parameterized complexity of geometric graph isomorphism ⋮ On the parameterized complexity of \(d\)-dimensional point set pattern matching ⋮ EQUIVALENCE OF TOPOLOGICAL FORM FOR CURVILINEAR GEOMETRIC OBJECTS ⋮ Enumeration of 2-level polytopes ⋮ Applications of dimensionality reduction and exponential sums to graph automorphism ⋮ Simple algorithms for partial point set pattern matching under rigid motion ⋮ ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES ⋮ On finding maximum-cardinality symmetric subsets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An n log n algorithm for determining the congruity of polyhedra
• Optimal algorithms for finding the symmetries of a planar point set
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• An application of pattern matching to a problem in geometrical complexity
• Congruence, similarity, and symmetries of geometric objects
• Point set pattern matching in \(d\)-dimensions
• An optimal algorithm for geometrical congruence