Walking your dog in the woods in polynomial time

DOI10.1145/1377676.1377694zbMath1221.68101OpenAlexW2096433419MaRDI QIDQ3602907

Francis Lazarus, Shripad Thite, Jeff Erickson, Éric Colin de Verdière, Sylvain Lazard, Erin Wolf 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) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (3)

Link distance and shortest path problems in the plane ⋮ Shortest path problems on a polyhedral surface ⋮ Generating surfaces by refinement of curves

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