pith. sign in

arxiv: math/0011128 · v1 · submitted 2000-11-17 · 🧮 math.DG

Polygon Recognition and Symmetry Detection

classification 🧮 math.DG
keywords recognitiondetectionalgorithmseuclideangroupmethodmodulopolygon
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.