An optimal vertex matching algorithm for polygonal shapes

MaRDI QIDQ3610702zbMATH OpenFDO

Authors Yichuan Ding, Ligang Liu

Publication date 6 March 2009

zbMATH Keywords

dynamic programmingshape matchingvertex correspondence

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Dynamic programming (90C39)

Recommendations

• Optimal matching of nonconvex polygons
• Matching general polygonal arcs
• Approximate matching of polygonal shapes
• An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves
• Probabilistic matching of planar regions

Cited in

(6)

• Shape recognition using attributed string matching with polygon vertices as the primitives
• Algorithm of dynamic programming for optimization of the global matching between two contours defined by ordered points
• Optimal matching of nonconvex polygons
• A modified vertex-based shape coding algorithm
• A dynamical systems approach for the shape matching of polytopes along rigid-body motions
• An algorithm to find polygon similarity

This page was built for publication: An optimal vertex matching algorithm for polygonal shapes

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