Locally correct Fréchet matchings

DOI10.1016/j.comgeo.2018.09.002zbMath1476.68279arXiv1206.6257OpenAlexW2892298325WikidataQ59782283 ScholiaQ59782283MaRDI QIDQ1624582

Maike Buchin, Wouter Meulemans, Kevin Buchin, Bettina Speckmann

Publication date: 16 November 2018

Published in: Computational Geometry, Algorithms – ESA 2012 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1206.6257

zbMATH Keywords

matchingsimilarityFréchet distancelocal correctness

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (4)

Approximating the integral Fréchet distance ⋮ Locally correct Fréchet matchings ⋮ Computing the Fréchet distance with a retractable leash ⋮ Four Soviets walk the dog: improved bounds for computing the Fréchet distance

Cites Work

• Computing the Fréchet distance with a retractable leash
• Fréchet distance with speed limits
• Approximating the integral Fréchet distance
• Locally correct Fréchet matchings
• New similarity measures between polylines with applications to morphing and polygon sweeping
• Four Soviets walk the dog: improved bounds for computing the Fréchet distance
• DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• The frechet distance revisited and extended
• Computing the Discrete Fréchet Distance in Subquadratic Time

This page was built for publication: Locally correct Fréchet matchings