Optimum sweeps of simple polygons with two guards

DOI10.1007/978-3-642-14553-7_29MaRDI QIDQ3587362zbMATHOpenAlexFDO

Authors 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)

Recommendations

• Optimum sweeps of simple polygons with two guards
• scientific article; zbMATH DE number 2081014
• Publication:4952719
• Searching a Polygonal Region by Two Guards
• Sweeping simple polygons with the minimum number of chain guards

Cited in

(10)

• Sweeping an oval to a vanishing point
• Sweeping Points
• scientific article; zbMATH DE number 1445396 (Why is no real title available?)
• Sweeping points
• scientific article; zbMATH DE number 2081014 (Why is no real title available?)
• Sweeping simple polygons with the minimum number of chain guards
• Optimum sweeps of simple polygons with two guards
• Minimization of the maximum distance between the two guards patrolling a polygonal region
• Minimization of the maximum distance between the two guards patrolling a polygonal region
• Sweeping costs of planar domains

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)