Abstract: We introduce an approach based on moving frames for polygon recognition and symmetry detection. We present detailed algorithms for recognition of polygons modulo the special Euclidean, Euclidean, equi-affine, skewed-affine and similarity Lie groups, and explain the procedure for a generic Lie group. The time complexity of our algorithms is linear in the number of vertices and they are noise resistant. The signatures used allow the detection of partial as well as approximate equivalences. Our method is a particular case of a general method for curve recognition modulo Lie group action.
Recommendations
Cited in
(12)- Recognizing polygons, or how to spy
- Optimal algorithms for symmetry detection in two and three dimensions
- Moving frames
- Detection of rotational and involutional symmetries and congruity of polyhedra
- I. GM-sets applied to Lie theory
- Recognition of triangles by covariogram
- The regular polygon detector
- scientific article; zbMATH DE number 6378923 (Why is no real title available?)
- Affine invariants of generalized polygons and matching under affine transformations
- scientific article; zbMATH DE number 176577 (Why is no real title available?)
- scientific article; zbMATH DE number 1759539 (Why is no real title available?)
- Invariants of objects and their images under surjective maps
This page was built for publication: Polygon recognition and symmetry detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1405723)