New similarity measures between polylines with applications to morphing and polygon sweeping
From MaRDI portal
Recommendations
Cited in
(19)- Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
- Computing homotopic line simplification
- Improved algorithms for partial curve matching
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance
- Similarity of polygonal curves in the presence of outliers
- Morphing between polylines
- Shortest path problems on a polyhedral surface
- AN OPTIMAL MORPHING BETWEEN POLYLINES
- Computing optimal homotopies over a spiked plane with polygonal boundary
- Fast Fréchet distance between curves with long edges
- AN APPROXIMATE MORPHING BETWEEN POLYLINES
- How to walk your dog in the mountains with no magic leash
- Fréchet distance with speed limits
- Link distance and shortest path problems in the plane
- A comparison of distance metrics for the multi-objective pathfinding problem
- Realizability of free spaces of curves
- Revisiting the Fréchet distance between piecewise smooth curves
- Realizability of free spaces of curves
- The geodesic Fréchet distance between two curves bounding a simple polygon
This page was built for publication: New similarity measures between polylines with applications to morphing and polygon sweeping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1864114)