Optimum sweeps of simple polygons with two guards

DOI10.1016/j.ipl.2013.11.002zbMath1284.68619OpenAlexW1559096963MaRDI QIDQ2445401

Xue-Hou 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

visibilitycomputational geometryray shootingpolygon sweep problemtwo-guard problem

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Sweeping simple polygons with the minimum number of chain guards
• Visibility and intersection problems in plane geometry
• CLEARING A POLYGON WITH TWO 1-SEARCHERS
• Searching for a Mobile Intruder in a Polygonal Region
• THE TWO GUARDS PROBLEM
• AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM
• Algorithms and Computation

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