AN OPTIMAL MORPHING BETWEEN POLYLINES

DOI10.1142/S0218195902000839MaRDI QIDQ4818557zbMATH OpenFDO

Authors Sergei Bespamyatnikh

Publication date 29 September 2004

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

Full work available at URL https://doi.org/10.1142/S0218195902000839

zbMATH Keywords

morphingpolylinesshortest pathskeleton

Mathematics Subject Classification ID

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

Recommendations

• Morphing between polylines
• Morphing Planar Graph Drawings Efficiently
• AN APPROXIMATE MORPHING BETWEEN POLYLINES
• New similarity measures between polylines with applications to morphing and polygon sweeping
• Publication:4886071

Cites work

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

Cited in

(6)

• New similarity measures between polylines with applications to morphing and polygon sweeping
• Computing homotopic line simplification
• Minimization of the maximum distance between the two guards patrolling a polygonal region
• Morphing between polylines
• FINDING AN OPTIMAL BRIDGE BETWEEN TWO POLYGONS
• AN APPROXIMATE MORPHING BETWEEN POLYLINES

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

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