Guarding in a simple polygon
type: Item
instance of: scholarly article
title: Guarding in a simple polygon
zbMATH Open document ID: 1003.68172
DOI: 10.1016/S0020-0190(00)00100-9
author: B.-K. Lu
author: F. R. Hsu
author: Chuan Yi Tang
published in: Information Processing Letters
publication date: 2002-07-25T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 52B55
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 1771767
zbMATH Keywords: art gallery problems
MaRDI profile type: Publication
cites work: Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon
cites work: Q4698690
cites work: An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment
cites work: An Almost Linear Time Algorithm for Generalized Matrix Searching
cites work: Q3799261
cites work: An optimal algorithm for detecting weak visibility of a polygon
cites work: EFFICIENT ALGORITHMS FOR SOLVING DIAGONAL VISIBILITY PROBLEMS IN A SIMPLE POLYGON
description: scientific article; zbMATH DE number 1771767