Walking your dog in the woods in polynomial time

DOI10.1145/1377676.1377694MaRDI QIDQ3602907zbMATH OpenOpenAlexFDO

Authors Éric Colin de Verdière, Jeff Erickson, Sylvain Lazard, Francis Lazarus, Shripad Thite, Erin W. Chambers

Publication date 12 February 2009

Published in Proceedings of the twenty-fourth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/inria-00336497/file/submission_105.pdf

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
• Four Soviets walk the dog: improved bounds for computing the Fréchet distance
• How to walk your dog in the mountains with no magic leash
• How to walk your dog in the mountains with no magic leash
• Computing the Fréchet distance with a retractable leash

Cited in

(5)

• Shortest path problems on a polyhedral surface
• How to walk your dog in the mountains with no magic leash
• How to walk your dog in the mountains with no magic leash
• Link distance and shortest path problems in the plane
• Generating surfaces by refinement of curves

This page was built for publication: Walking your dog in the woods in polynomial time

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