The Prefix Fréchet Similarity

DOI10.1007/978-3-030-10564-8_8MaRDI QIDQ5236161zbMATH OpenOpenAlexFDO

Authors Christian Scheffer

Publication date 15 October 2019

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-10564-8_8

zbMATH Keywords

curve matchingFréchet distanceprefix curves

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05)

Recommendations

• The prefix Fréchet similarity
• FRESH: Fréchet similarity with hashing
• Similarity relations and repetition-freeness
• On similarity
• Similarity and cotenability
• Similarity relations on words
• scientific article; zbMATH DE number 2079424
• The Similarity Metric
• scientific article; zbMATH DE number 4190462
• Similarity overF[x]

Cited in

(1)

• The prefix Fréchet similarity

This page was built for publication: The Prefix Fréchet Similarity

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