Improved algorithms for partial curve matching

DOI10.1007/S00453-013-9758-3MaRDI QIDQ2249744zbMATH OpenOpenAlexWikidataFDO

Authors Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh

Publication date 3 July 2014

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-013-9758-3

zbMATH Keywords

closed curvesfree-space mapFréchet distancepartial curve matching

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40)

Recommendations

• Improved algorithms for partial curve matching
• scientific article; zbMATH DE number 7051233
• scientific article; zbMATH DE number 1689042
• Approximate Map Matching with respect to the Fréchet Distance
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES

Cites work

• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Fréchet distance with speed limits
• Geodesic Fréchet distance inside a simple polygon
• scientific article; zbMATH DE number 7051233 (Why is no real title available?)
• Matching planar maps
• New similarity measures between polylines with applications to morphing and polygon sweeping
• The Computational Geometry of Comparing Shapes

Cited in

(6)

• The prefix Fréchet similarity
• Minimizing walking length in map matching
• More flexible curve matching via the partial Fréchet similarity
• Improved algorithms for partial curve matching
• scientific article; zbMATH DE number 7051233 (Why is no real title available?)
• Fast map matching with vertex-monotone Fréchet distance

This page was built for publication: Improved algorithms for partial curve matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2249744)