Polygon recognition and symmetry detection

DOI10.1007/S10208-001-0027-5zbMATH Open1045.53011arXivmath/0011128OpenAlexW1971248964MaRDI QIDQ1405723FDOQ1405723

Mireille Boutin

Publication date: 26 August 2003

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/math/0011128

zbMATH Keywords

invariantssymmetry detectionpolygon recognition

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Differential invariants (local theory), geometric objects (53A55) Machine vision and scene understanding (68T45)

Cited In (7)

• Moving frames
• Invariants of objects and their images under surjective maps
• Title not available (Why is that?)
• Recognition of triangles by covariogram
• Recognizing polygons, or how to spy
• Title not available (Why is that?)
• I. GM-sets applied to Lie theory

Recommendations

• Title not available (Why is that?) 👍 👎
• Polygon Graph Recognition 👍 👎
• Detection of rotational and involutional symmetries and congruity of polyhedra 👍 👎
• SHAPE PARTITIONING BASED ON SYMMETRIES DETECTION 👍 👎

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)