Art gallery problem with guards whose range of vision is \(180^{\circ}\)
type: Item
instance of: scholarly article
title: Art gallery problem with guards whose range of vision is \(180^{\circ}\)
zbMATH Open document ID: 0968.68166
DOI: 10.1016/S0925-7721(00)00023-7
author: Csaba D. Tóth
published in: Computational Geometry
publication date: 2001-02-11T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1563817
zbMATH Keywords: art gallery
MaRDI profile type: Publication
cites work: The Floodlight Problem
cites work: A combinatorial theorem in plane geometry
cites work: Note on an art gallery problem
cites work: Illumination of polygons with vertex lights
cites work: A short proof of Chvatal's Watchman Theorem
cites work: Q3799261
cites work: Q4401015
cites work: The vertex-edge visibility graph of a polygon
cites work: Q4401013
cites work: Q4352317
cites work: Art galleries with guards of uniform range of vision
cites work: Q4945523
full work available at URL: s0925-7721(00)00023-7
OpenAlex ID: W2082825683
Recommended article: Q5489465
Recommended article: Art galleries with guards of uniform range of vision
Recommended article: Note on an art gallery problem
Recommended article: Guarding curvilinear art galleries with vertex or point guards
Recommended article: Q4038729
Recommended article: Q2779387
Recommended article: Art gallery problem with rook and queen vision
Recommended article: A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras
Recommended article: Q3644846
description: scientific article; zbMATH DE number 1563817