Discrete Fréchet Distance under Translation

DOI10.1145/3460656OpenAlexW3184650363MaRDI QIDQ5032034FDOQ5032034

Authors: Karl Bringmann, Marvin Künnemann, André Nusser 

Publication date: 16 February 2022

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

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

Recommendations

• Fréchet distance under translation: conditional hardness and an algorithm via offline dynamic grid reachability
• scientific article; zbMATH DE number 7238975
• Algorithms for the discrete Fréchet distance under translation
• Item:QQ5494924
• Item:QQ5494924

zbMATH Keywords

conditional lower boundsFréchet distance

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (4)

• Title not available (Why is that?)
• The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
• Dynamic time warping under translation: approximation guided by space-filling curves
• Title not available (Why is that?)

This page was built for publication: Discrete Fréchet Distance under Translation

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