Sweeping simple polygons with the minimum number of chain guards

DOI10.1016/J.IPL.2006.11.010zbMATH Open1184.68571OpenAlexW1989326554MaRDI QIDQ845964FDOQ845964

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

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

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)

Cites Work

• Searching for a Mobile Intruder in a Polygonal Region
• AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT
• Title not available (Why is that?)
• Combinatorial Geometry and Graph Theory
• THE TWO GUARDS PROBLEM
• SEARCHING A POLYGONAL REGION FROM THE BOUNDARY
• SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER
• AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM
• Algorithms and Computation

Cited In (8)

• 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
• A unified and efficient solution to the room search problem
• An annotated bibliography on guaranteed graph searching
• An efficient algorithm for the three-guard problem
• Title not available (Why is that?)
• Searching for mobile intruders in circular corridors by two 1-searchers

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)