AN APPROXIMATE MORPHING BETWEEN POLYLINES

DOI10.1142/S0218195905001658MaRDI QIDQ5311633zbMATH OpenOpenAlexFDO

Authors Sergey Bereg

Publication date 23 August 2005

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

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

zbMATH Keywords

Morphingpolylinesshortest path

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• AN OPTIMAL MORPHING BETWEEN POLYLINES
• Morphing between polylines
• Efficient algorithms for approximating polygonal chains
• New similarity measures between polylines with applications to morphing and polygon sweeping
• Planar and Toroidal Morphs Made Easier

Cites work

• AN OPTIMAL MORPHING BETWEEN POLYLINES
• Approximate decision algorithms for point set congruence
• 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
• Finding the medial axis of a simple polygon in linear time
• Geometry helps in bottleneck matching and related problems
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Matching Shapes with a Reference Point
• Medial Axis Transformation of a Planar Shape
• Morphing simple polygons
• New similarity measures between polylines with applications to morphing and polygon sweeping
• RANDOMIZATION YIELDS SIMPLE O(n log^⋆ n) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS

Cited in

(4)

• Morphing simple polygons
• New similarity measures between polylines with applications to morphing and polygon sweeping
• Morphing between polylines
• AN OPTIMAL MORPHING BETWEEN POLYLINES

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

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