Inspecting a Set of Strips Optimally

DOI10.1007/978-3-642-03367-4_37MaRDI QIDQ3183473zbMATH OpenOpenAlexFDO

Authors Tom Kamphans, Elmar Langetepe

Publication date 20 October 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03367-4_37

zbMATH Keywords

computational geometrymotion planningoptimal algorithmoptimal inspection pathwatchman routes

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 1555918
• Optimum watchman routes
• Optimal trajectory in \(\mathbb{R}^2\) under observation
• Watchman routes for lines and line segments
• Watchman routes for lines and segments

Cites work

• Computing and Combinatorics
• Finding Popular Places
• How to learn an unknown environment. I
• scientific article; zbMATH DE number 194971 (Why is no real title available?)
• scientific article; zbMATH DE number 2085302 (Why is no real title available?)
• scientific article; zbMATH DE number 1424303 (Why is no real title available?)
• Optimum watchman routes
• The polygon exploration problem
• The zookeeper route problem
• Touring a sequence of polygons

This page was built for publication: Inspecting a Set of Strips Optimally

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