Walking the dog fast in practice: algorithm engineering of the Fréchet distance

DOI10.20382/JOCG.V12I1A4MaRDI QIDQ4958385zbMATH OpenOpenAlexFDO

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

Publication date 7 September 2021

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

Mathematics Subject Classification ID

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

Recommendations

• Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance
• Four Soviets walk the dog: improved bounds for computing the Fréchet distance
• Four Soviets walk the dog -- with an application to Alt's conjecture
• Computing the Fréchet distance with a retractable leash
• Computing the Fréchet distance with a retractable leash

Cited in

(6)

• The VC dimension of metric balls under Fréchet and Hausdorff distances
• Computing the Fréchet distance with a retractable leash
• Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance
• scientific article; zbMATH DE number 7650283 (Why is no real title available?)
• Title not available (Why is no real title available?)
• Faster Fréchet distance under transformations

This page was built for publication: Walking the dog fast in practice: algorithm engineering of the Fréchet distance

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