The Two-Guard Polygon Walk Problem

DOI10.1007/978-3-642-02017-9_47MaRDI QIDQ3630230zbMATH OpenOpenAlexFDO

Authors John Zhang

Publication date 3 June 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-02017-9_47

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1834577
• Walkability in polygons by two guards: a revisit
• Two-Guard Walkability of Simple Polygons
• Hide-and-seek: algorithms for polygon walk problems
• The Parameterized Complexity of Guarding Almost Convex Polygons.
• Algorithms and Computation
• Computing 2-walks in polynomial time
• Computing 2-walks in polynomial time
• A linear-time 2-approximation algorithm for the watchman route problem for simple polygons
• scientific article; zbMATH DE number 177562

Cited in

(8)

• Partially walking a polygon
• Hide-and-seek: algorithms for polygon walk problems
• Two-Guard Walkability of Simple Polygons
• scientific article; zbMATH DE number 1834577 (Why is no real title available?)
• AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM
• Partially Walking a Polygon
• Algorithms and Computation
• Walkability in polygons by two guards: a revisit

This page was built for publication: The Two-Guard Polygon Walk Problem

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