AN OPTIMAL MORPHING BETWEEN POLYLINES

DOI10.1142/S0218195902000839zbMath1152.68655MaRDI QIDQ4818557

Sergei Bespamyatnikh

Publication date: 29 September 2004

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

shortest pathmorphingskeletonpolylines

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (3)

AN APPROXIMATE MORPHING BETWEEN POLYLINES ⋮ Minimization of the maximum distance between the two guards patrolling a polygonal region ⋮ Computing homotopic line simplification

Cites Work

• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Computing minimum length paths of a given homotopy class
• Morphing simple polygons
• Congruence, similarity, and symmetries of geometric objects
• Matching Shapes with a Reference Point
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES

This page was built for publication: AN OPTIMAL MORPHING BETWEEN POLYLINES