An efficient algorithm for the three-guard problem

DOI10.1016/j.dam.2008.05.007zbMath1162.68773OpenAlexW1969300438MaRDI QIDQ1003478

Xue-Hou Tan

Publication date: 4 March 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.05.007

zbMATH Keywords

computational geometryweak visibilityray shootinglink-2-visibilitythree-guard problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Minimization of the maximum distance between the two guards patrolling a polygonal region ⋮ Characterizing and recognizing LR-visibility polygons

Cites Work

• Sweeping simple polygons with the minimum number of chain guards
• Visibility and intersection problems in plane geometry
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• A unified and efficient solution to the room search problem
• Searching for a Mobile Intruder in a Polygonal Region
• THE TWO GUARDS PROBLEM
• Two-Guard Walkability of Simple Polygons
• SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
• AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM
• Algorithms and Computation
• Characterizing LR-visibility polygons and related problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient algorithm for the three-guard problem