Optimum sweeps of simple polygons with two guards

DOI10.1007/978-3-642-14553-7_29zbMATH Open1288.68233OpenAlexW4241128317MaRDI QIDQ3587362FDOQ3587362

Bo Jiang, Xuehou Tan

Publication date: 7 September 2010

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14553-7_29

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Paths and cycles (05C38)

Cited In (3)

• Minimization of the maximum distance between the two guards patrolling a polygonal region
• Title not available (Why is that?)
• Title not available (Why is that?)

   Recommendations

• Optimum sweeps of simple polygons with two guards 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Searching a Polygonal Region by Two Guards 👍 👎
• Sweeping simple polygons with the minimum number of chain guards 👍 👎

This page was built for publication: Optimum sweeps of simple polygons with two guards

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