An algorithm to find polygon similarity

DOI10.1016/0020-0190(89)90142-7MaRDI QIDQ582069zbMATH OpenOpenAlexFDO

Authors Jayaramaiah Boreddy, R. N. Mukherjee

Publication date 1989

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

Full work available at URL https://doi.org/10.1016/0020-0190(89)90142-7

zbMATH Keywords

triangulationcentroidaffine transformationssimilarity measurenormalisationcyclic permutationcyclically ordered

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Polytopes and polyhedra (52Bxx) Algorithms in computer science (68W99)

Recommendations

• Publication:3484354
• Approximate matching of polygonal shapes
• An optimal vertex matching algorithm for polygonal shapes
• scientific article; zbMATH DE number 1190951
• A non-recursive algorithm for polygon triangulation
• An optimal algorithm for finding the separation of simple polygons
• A polygon clipping algorithm
• Fast Matching Algorithms for Points on a Polygon

Cites work

• An application of pattern matching to a problem in geometrical complexity
• An improved algorithm to check for polygon similarity
• On polygon similarity

Cited in

(1)

• On similarity of polynomial configurations

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

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