Optimum sweeps of simple polygons with two guards

DOI10.1016/J.IPL.2013.11.002MaRDI QIDQ2445401zbMATH OpenOpenAlexFDO

Authors Xuehou Tan, Bo Jiang

Publication date 14 April 2014

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2013.11.002

zbMATH Keywords

computational geometrypolygon sweep problemray shootingtwo-guard problemvisibility

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Optimum sweeps of simple polygons with two guards
• scientific article; zbMATH DE number 2081014
• scientific article; zbMATH DE number 1445396
• THE TWO GUARDS PROBLEM
• Minimization of the maximum distance between the two guards patrolling a polygonal region

Cites work

• Algorithms and Computation
• AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM
• CLEARING A POLYGON WITH TWO 1-SEARCHERS
• scientific article; zbMATH DE number 1834577 (Why is no real title available?)
• scientific article; zbMATH DE number 1445396 (Why is no real title available?)
• Searching for a Mobile Intruder in a Polygonal Region
• Sweeping simple polygons with the minimum number of chain guards
• THE TWO GUARDS PROBLEM
• Visibility and intersection problems in plane geometry

Cited in

(9)

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