Improved algorithms for partial curve matching

DOI10.1007/978-3-642-23719-5_44MaRDI QIDQ3092257zbMATH OpenOpenAlexDBLPWikidataFDO

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

Publication date 16 September 2011

Published in Algorithms – ESA 2011 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-23719-5_44

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(7)

• Improved algorithms for partial curve matching
• Four Soviets walk the dog: improved bounds for computing the Fréchet distance
• scientific article; zbMATH DE number 1689042 (Why is no real title available?)
• Minimizing walking length in map matching
• More flexible curve matching via the partial Fréchet similarity
• Discretely following a curve
• scientific article; zbMATH DE number 7051233 (Why is no real title available?)

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 Q3092257)