Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts
From MaRDI portal
Publication:5396948
DOI10.1137/120865112zbMath1286.65030arXiv1107.1720OpenAlexW2083364906MaRDI QIDQ5396948
Anne Driemel, Sariel Har-Peled
Publication date: 4 February 2014
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.1720
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Approximation algorithms (68W25)
Related Items (21)
On the Chain Pair Simplification Problem ⋮ Four Soviets walk the dog: improved bounds for computing the Fréchet distance ⋮ Translation invariant Fréchet distance queries ⋮ Approximating ( k,ℓ )-Median Clustering for Polygonal Curves ⋮ Fréchet Distance for Uncertain Curves ⋮ On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions ⋮ Shortcut hulls: vertex-restricted outer simplifications of polygons ⋮ Unnamed Item ⋮ Computing the Fréchet distance between folded polygons ⋮ Fast Fréchet queries ⋮ Universal approximate simplification under the discrete Fréchet distance ⋮ Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds ⋮ Approximate nearest neighbor for curves: simple, efficient, and deterministic ⋮ Approximating the Packedness of Polygonal Curves ⋮ Computing the Fréchet gap distance ⋮ Fast Fréchet Distance Between Curves with Long Edges ⋮ Global Curve Simplification ⋮ Unnamed Item ⋮ Approximating the packedness of polygonal curves ⋮ Unnamed Item ⋮ Fast algorithms for approximate Fréchet matching queries in geometric trees
This page was built for publication: Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts
