Sweeping simple polygons with the minimum number of chain guards

DOI10.1016/j.ipl.2006.11.010zbMath1184.68571OpenAlexW1989326554MaRDI QIDQ845964

Xue-Hou Tan

Publication date: 29 January 2010

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

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

zbMATH Keywords

analysis of algorithmscomputational geometrylink diagramssweeping polygons with chain guards

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (6)

Searching for mobile intruders in circular corridors by two 1-searchers ⋮ Optimum sweeps of simple polygons with two guards ⋮ Minimization of the maximum distance between the two guards patrolling a polygonal region ⋮ An annotated bibliography on guaranteed graph searching ⋮ A unified and efficient solution to the room search problem ⋮ An efficient algorithm for the three-guard problem

Cites Work

• Unnamed Item
• Searching for a Mobile Intruder in a Polygonal Region
• THE TWO GUARDS PROBLEM
• SEARCHING A POLYGONAL REGION FROM THE BOUNDARY
• SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER
• AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT
• AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM
• Combinatorial Geometry and Graph Theory
• Algorithms and Computation

This page was built for publication: Sweeping simple polygons with the minimum number of chain guards