An application of pattern matching to a problem in geometrical complexity

DOI10.1016/0020-0190(76)90092-2zbMath0348.68056OpenAlexW2044586112MaRDI QIDQ1234596

Glenn K. Manacher

Publication date: 1976

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

Full work available at URL: https://doi.org/10.1016/0020-0190(76)90092-2

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10) Algorithms in computer science (68W99)

Related Items

On determining the congruence of point sets in \(d\) dimensions ⋮ Checking similarity of planar figures ⋮ On geometric shape construction via growth operations ⋮ On geometric shape construction via growth operations ⋮ An algorithm to find polygon similarity ⋮ An improved algorithm to check for polygon similarity ⋮ A fast equivalence-checking algorithm for circular lists ⋮ On polygon similarity ⋮ Optimal algorithms for symmetry detection in two and three dimensions ⋮ ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES

Cites Work

• Fast Pattern Matching in Strings
• Unnamed Item
• Unnamed Item