THE TWO GUARDS PROBLEM

DOI10.1142/S0218195992000160MaRDI QIDQ4030351zbMATH OpenFDO

Authors Christian Icking, Rolf Klein

Publication date 1 April 1993

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0218195992000160

zbMATH Keywords

polygonvisibilitywatchman problems

Mathematics Subject Classification ID

Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Algorithms and Computation
• AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM
• The 2-evader problem
• scientific article; zbMATH DE number 2148113
• scientific article; zbMATH DE number 970601
• scientific article; zbMATH DE number 589173
• The problem of two sticks
• The problem of pawns
• scientific article; zbMATH DE number 1775155

Cited in

(45)

• An efficient algorithm for the three-guard problem
• An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons
• Optimally computing a shortest weakly visible line segment inside a simple polygon
• Simple algorithms for searching a polygon with flashlights
• Partially walking a polygon
• Optimum sweeps of simple polygons with two guards
• Minimization of the maximum distance between the two guards patrolling a polygonal region
• Characterizing and recognizing LR-visibility polygons
• A unified and efficient solution to the room search problem
• Minimization of the maximum distance between the two guards patrolling a polygonal region
• Hide-and-seek: algorithms for polygon walk problems
• GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRA
• A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable
• A problem of guarding line segment
• Finding all door locations that make a room searchable
• CLEARING A POLYGON WITH TWO 1-SEARCHERS
• scientific article; zbMATH DE number 589173 (Why is no real title available?)
• Two-Guard Walkability of Simple Polygons
• EDGE GUARDS IN STRAIGHT WALKABLE POLYGONS
• The burglar problem with multiple options
• Universal guard problems
• scientific article; zbMATH DE number 2148113 (Why is no real title available?)
• 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
• SEARCHING A ROOM BY TWO GUARDS
• AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM
• Finding all weakly-visible chords of a polygon in linear time
• On a generalized lifeguard problem
• Partially Walking a Polygon
• On hamiltonian triangulations in simple polygons (Extended Abstract)
• Line-of-sight pursuit in monotone and scallop polygons
• scientific article; zbMATH DE number 6469255 (Why is no real title available?)
• An Efficient Algorithm for Mobile Guarded Guards in Simple Grids
• Algorithms and Computation
• Walkability in polygons by two guards: a revisit
• Algorithms and Computation
• Two-guarding a rectilinear polygon
• On generalized lifeguard problem
• Searching for mobile intruders in circular corridors by two 1-searchers
• LR-visibility in polygons
• The two-guard problem on curvilinear polygons
• Sweeping a domain with line-of-sight between covisible agents
• Searching a polygonal region by a group of stationary \(k\)-searchers
• Sweeping simple polygons with the minimum number of chain guards

This page was built for publication: THE TWO GUARDS PROBLEM

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