The Two-Guard Polygon Walk Problem

DOI10.1007/978-3-642-02017-9_47zbMATH Open1241.68125OpenAlexW1842824552MaRDI QIDQ3630230

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)

Related Items (1)

Algorithms and Computation

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A linear-time 2-approximation algorithm for the watchman route problem for simple polygons 👍 👎
• Computing 2-Walks in Polynomial Time 👍 👎
• Hide-and-Seek: Algorithms for Polygon Walk Problems 👍 👎
• Two-Guard Walkability of Simple Polygons 👍 👎
• Computing 2-Walks in Polynomial Time 👍 👎
• Algorithms and Computation 👍 👎
• The Parameterized Complexity of Guarding Almost Convex Polygons. 👍 👎

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)