THE TWO GUARDS PROBLEM
From MaRDI portal
Publication:4030351
DOI10.1142/S0218195992000160zbMath0762.68031MaRDI QIDQ4030351
Publication date: 1 April 1993
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)
Related Items
Optimally computing a shortest weakly visible line segment inside a simple polygon, An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons, Searching a polygonal region by a group of stationary \(k\)-searchers, Finding all weakly-visible chords of a polygon in linear time, Sweeping simple polygons with the minimum number of chain guards, AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT, SEARCHING A ROOM BY TWO GUARDS, On hamiltonian triangulations in simple polygons (Extended Abstract), A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable, 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, Characterizing and recognizing LR-visibility polygons, Line-of-Sight Pursuit in Monotone and Scallop Polygons, LR-visibility in polygons, Hide-and-Seek: Algorithms for Polygon Walk Problems, FINDING ALL DOOR LOCATIONS THAT MAKE A ROOM SEARCHABLE, A unified and efficient solution to the room search problem, SEARCHING A POLYGONAL REGION FROM THE BOUNDARY, SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER, An efficient algorithm for the three-guard problem, GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRA, CLEARING A POLYGON WITH TWO 1-SEARCHERS, Partially Walking a Polygon, Simple algorithms for searching a polygon with flashlights, EDGE GUARDS IN STRAIGHT WALKABLE POLYGONS
