New similarity measures between polylines with applications to morphing and polygon sweeping
From MaRDI portal
(Redirected from Publication:1864114)
Recommendations
Cited in
(15)- Fast Fréchet distance between curves with long edges
- Shortest path problems on a polyhedral surface
- Improved algorithms for partial curve matching
- How to walk your dog in the mountains with no magic leash
- Morphing between polylines
- AN APPROXIMATE MORPHING BETWEEN POLYLINES
- Similarity of polygonal curves in the presence of outliers
- Computing homotopic line simplification
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance
- Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
- Computing optimal homotopies over a spiked plane with polygonal boundary
- A comparison of distance metrics for the multi-objective pathfinding problem
- Fréchet distance with speed limits
- AN OPTIMAL MORPHING BETWEEN POLYLINES
- Link distance and shortest path problems in the plane
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)