Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An improved algorithm to check for polygon similarity

From MaRDI portal
Publication:1245010
Jump to:navigation, search

DOI10.1016/0020-0190(78)90073-XzbMath0374.68061MaRDI QIDQ1245010

Godfried T. Toussaint, Selim G. Akl

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)


Related Items

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



Cites Work

  • Unnamed Item
  • An application of pattern matching to a problem in geometrical complexity
  • A fast string searching algorithm
  • Pattern Matching Under Affine Transformations
  • Fast Pattern Matching in Strings
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1245010&oldid=13330430"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 09:25.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki