Sweeping simple polygons with the minimum number of chain guards

DOI10.1016/J.IPL.2006.11.010MaRDI QIDQ845964zbMATH OpenOpenAlexFDO

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

Recommendations

• Publication:4952719
• scientific article; zbMATH DE number 2080272
• Optimum sweeps of simple polygons with two guards
• scientific article; zbMATH DE number 2081014
• Optimum sweeps of simple polygons with two guards

Cites work

• scientific article; zbMATH DE number 1445396 (Why is no real title available?)
• AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT
• AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM
• Algorithms and Computation
• Combinatorial Geometry and Graph Theory
• SEARCHING A POLYGONAL REGION FROM THE BOUNDARY
• SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER
• Searching for a Mobile Intruder in a Polygonal Region
• THE TWO GUARDS PROBLEM

Cited in

(8)

• An efficient algorithm for the three-guard problem
• Searching for mobile intruders in circular corridors by two 1-searchers
• A unified and efficient solution to the room search problem
• scientific article; zbMATH DE number 1445396 (Why is no real title available?)
• Optimum sweeps of simple polygons with two guards
• Minimization of the maximum distance between the two guards patrolling a polygonal region
• Optimum sweeps of simple polygons with two guards
• An annotated bibliography on guaranteed graph searching

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

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