Checking similarity of planar figures

DOI10.1007/BF00977833zbMath0556.68047OpenAlexW2049621921MaRDI QIDQ3219798

Mikhail J. Atallah

Publication date: 1984

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00977833

zbMATH Keywords

pattern recognitionanalysis of algorithmscomputational geometryefficient algorithmstring pattern matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10) Discrete mathematics in relation to computer science (68R99)

Related Items (3)

Linear time algorithms for testing approximate congruence in the plane ⋮ Approximate decision algorithms for approximate congruence ⋮ Congruence, similarity, and symmetries of geometric objects

Cites Work

• Unnamed Item
• An application of pattern matching to a problem in geometrical complexity
• On the Optimality of Some Set Algorithms

This page was built for publication: Checking similarity of planar figures