Fréchet distance with speed limits
From MaRDI portal
Publication:621928
DOI10.1016/j.comgeo.2010.09.008zbMath1209.65060OpenAlexW2008735761WikidataQ62037448 ScholiaQ62037448MaRDI QIDQ621928
Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh, Kaveh Shahbaz, Anil Maheshwari
Publication date: 31 January 2011
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2010.09.008
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items
Computing the similarity between moving curves, The prefix Fréchet similarity, Locally correct Fréchet matchings, Four Soviets walk the dog: improved bounds for computing the Fréchet distance, Fréchet Distance for Uncertain Curves, Fréchet distance with speed limits, Unnamed Item, On length-sensitive Fréchet similarity, Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds, Improved algorithms for partial curve matching, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Fréchet distance with speed limits
- Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
- New similarity measures between polylines with applications to morphing and polygon sweeping
- Shortest Path Problems on a Polyhedral Surface
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Matching planar maps
- Slowing down sorting networks to obtain faster sorting algorithms
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES