AN APPROXIMATE MORPHING BETWEEN POLYLINES
From MaRDI portal
Publication:5311633
DOI10.1142/S0218195905001658zbMath1067.68158OpenAlexW2164071950MaRDI QIDQ5311633
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
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Finding the medial axis of a simple polygon in linear time
- Approximate decision algorithms for point set congruence
- Computing minimum length paths of a given homotopy class
- Morphing simple polygons
- Congruence, similarity, and symmetries of geometric objects
- New similarity measures between polylines with applications to morphing and polygon sweeping
- Medial Axis Transformation of a Planar Shape
- RANDOMIZATION YIELDS SIMPLE O(n log⋆ n) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS
- Matching Shapes with a Reference Point
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- AN OPTIMAL MORPHING BETWEEN POLYLINES
- Geometry helps in bottleneck matching and related problems
