Testing approximate symmetry in the plane is NP-hard

DOI10.1016/0304-3975(91)90389-JzbMath0745.68056MaRDI QIDQ1176235

Sebastian Iwanowski

Publication date: 25 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

pattern recognitionsymmetry grouproboticscrystallographybiology\(NP\)-hard

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (3)

Convex transversals ⋮ Point matching under non-uniform distortions. ⋮ On finding maximum-cardinality symmetric subsets

Cites Work

• Optimal algorithms for finding the symmetries of a planar point set
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Congruence, similarity, and symmetries of geometric objects
• Planar 3DM is NP-complete
• Planar Formulae and Their Uses
• Fast Multiple-Precision Evaluation of Elementary Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Testing approximate symmetry in the plane is NP-hard