An efficient algorithm for the three-guard problem
type: Item
instance of: scholarly article
title: An efficient algorithm for the three-guard problem
zbMATH Open document ID: 1162.68773
published in: Discrete Applied Mathematics
publication date: 2009-03-04T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 5522972
zbMATH Keywords: computational geometry
zbMATH Keywords: weak visibility
zbMATH Keywords: three-guard problem
zbMATH Keywords: ray shooting
zbMATH Keywords: link-2-visibility
author: Xuehou Tan
MaRDI profile type: Publication
full work available at URL: j.dam.2008.05.007
OpenAlex ID: W1969300438
cites work: Characterizing LR-visibility polygons and related problems
cites work: Q4779120
cites work: Visibility and intersection problems in plane geometry
cites work: SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
cites work: Q4952719
cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
cites work: AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM
cites work: THE TWO GUARDS PROBLEM
cites work: Searching for a Mobile Intruder in a Polygonal Region
cites work: Q4472523
cites work: Algorithms and Computation
cites work: Sweeping simple polygons with the minimum number of chain guards
cites work: A unified and efficient solution to the room search problem
cites work: Two-Guard Walkability of Simple Polygons
DOI: 10.1016/J.DAM.2008.05.007
Recommended article: AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM
Recommended article: An efficient algorithm for the 3-satisfiability problem
Recommended article: The Guarding Problem – Complexity and Approximation
Recommended article: An Efficient Algorithm for Mobile Guarded Guards in Simple Grids
Recommended article: An approximate algorithm for the three-machine problem
Recommended article: An efficient algorithm for solving Troesch's problem
Recommended article: An Optimal Algorithm for the Maximum Three-Chain Problem
Recommended article: An efficient algorithm for guard placement in polygons with holes
Recommended article: Q3030136
description: scientific article; zbMATH DE number 5522972