An improved algorithm to check for polygon similarity

DOI10.1016/0020-0190(78)90073-XMaRDI QIDQ1245010zbMATH OpenFDO

Authors Selim G. Akl, Godfried Toussaint

Publication date 1978

Published in Information Processing Letters (Search for Journal in Brave)

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Algorithms in computer science (68W99)

Cites work

• scientific article; zbMATH DE number 3557226 (Why is no real title available?)
• A fast string searching algorithm
• An application of pattern matching to a problem in geometrical complexity
• Fast Pattern Matching in Strings
• Pattern Matching Under Affine Transformations

Cited in

(11)

• On similarity of polynomial configurations
• On geometric shape construction via growth operations
• Addendum to ``An improved algorithm to check for polygon similarity
• Optimal canonization of all substrings of a string
• Optimal algorithms for computing the canonical form of a circular string
• A fast equivalence-checking algorithm for circular lists
• An algorithm to find polygon similarity
• On polygon similarity
• A fast average case algorithm for lyndon decomposition
• On geometric shape construction via growth operations
• Fast parallel Lyndon factorization with applications

This page was built for publication: An improved algorithm to check for polygon similarity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1245010)