Optimal algorithms for finding the symmetries of a planar point set
From MaRDI portal
Publication:1075773
DOI10.1016/0020-0190(86)90097-9zbMath0592.68064OpenAlexW2036429506MaRDI QIDQ1075773
Publication date: 1986
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(86)90097-9
Related Items (8)
On determining the congruence of point sets in \(d\) dimensions ⋮ A new measure of symmetry and its application to classification of bifurcating structures ⋮ Testing approximate symmetry in the plane is NP-hard ⋮ Fast detection and display of symmetry in outerplanar graphs ⋮ TURNING SHAPE DECISION PROBLEMS INTO MEASURES ⋮ Assembly code generation from a feature-based geometric model ⋮ Congruence, similarity, and symmetries of geometric objects ⋮ On finding maximum-cardinality symmetric subsets
Cites Work
This page was built for publication: Optimal algorithms for finding the symmetries of a planar point set
