Intelligent Systems.
Theory and Applications

(Intellektual'nye Sistemy. Teoriya i Prilozheniya)

Encoding closed polygonal chains using local area relations

Abstract

An encoding method based on oriented triangle areas is proposed for deciding affine equivalence of closed planar polygonal chains. The method arranges normalized oriented-area differences generated by the vertices of the chain and their neighbors into a matrix. For two closed polygonal chains with the same number of vertices, with the vertices of each chain not all collinear, equivalence of their codes is proved equivalent to the existence of an invertible affine transformation matching their vertices up to a cyclic shift or a reversal of order.

Keywords: closed polygonal chains, oriented area, affine invariants, completeness.

BibTeX
@article{IS-Wang2026,
  author  = {Wang, Siren},
  title   = {{Encoding closed polygonal chains using local area relations}},
  journal = {Intelligent Systems. Theory and Applications},
  year    = {2026},
  volume  = {30},
  number  = {4},
  pages   = {349--352},
}
AMSBIB
\Bibitem{IS-Wang2026}
\by S.~Wang
\paper Encoding closed polygonal chains using local area relations
\jour Intelligent Systems. Theory and Applications
\yr 2026
\vol 30
\issue 4
\pages 349--352
\lang In Russian
Published under Creative Commons Attribution 4.0 International (CC BY 4.0)

← Back to issue

× Issue cover