Four Soviets walk the dog -- with an application to Alt's conjecture

DOI10.1137/1.9781611973402.103zbMATH Open1420.68224OpenAlexW2952237967MaRDI QIDQ5384065FDOQ5384065

Authors: Kevin Buchin, Maike Buchin, Wouter Meulemans, Wolfgang Mulzer 

Publication date: 20 June 2019

Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973402.103

Recommendations

• Four Soviets walk the dog: improved bounds for computing the Fréchet distance
• Computing the Fréchet distance with a retractable leash
• Computing the Fréchet distance with a retractable leash

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (12)

• Dynamic set intersection
• Tighter connections between Formula-SAT and shaving logs
• Four Soviets walk the dog: improved bounds for computing the Fréchet distance
• Fast algorithms for approximate Fréchet matching queries in geometric trees
• On the Chain Pair Simplification Problem
• Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds
• Computing the Fréchet gap distance
• Computing the Fréchet distance with a retractable leash
• Computing the Fréchet distance between folded polygons
• Weighted minimum backward Fréchet distance
• Walking the dog fast in practice: algorithm engineering of the Fréchet distance
• Title not available (Why is that?)

This page was built for publication: Four Soviets walk the dog -- with an application to Alt's conjecture

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