Watchman routes in the presence of a pair of convex polygons
type: Item
instance of: scholarly article
title: Watchman routes in the presence of a pair of convex polygons
zbMATH Open document ID: 0947.68155
DOI: 10.1016/S0020-0255(97)10033-0
author: Laxmi P. Gewali
author: Simeon C. Ntafos
published in: Information Sciences
publication date: 1999-06-10T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1299797
zbMATH Keywords: shortest watchman route problem
MaRDI profile type: Publication
cites work: Art Gallery Problems for Convex Nested Polygons
cites work: Q3799261
cites work: Q3138983
cites work: Shortest watchman routes in simple polygons
cites work: Optimum watchman routes
cites work: Q3136961
cites work: Q3694703
cites work: Q4037433
cites work: Computational complexity of art gallery problems
cites work: Q4040234
full work available at URL: s0020-0255(97)10033-0
OpenAlex ID: W2020982884
Recommended article: Q3136961
Recommended article: Shortest watchman routes in simple polygons
Recommended article: Finding the shortest watchman route in a simple polygon
Recommended article: A linear-time 2-approximation algorithm for the watchman route problem for simple polygons
Recommended article: Fast computation of shortest watchman routes in simple polygons
Recommended article: Q4037433
Recommended article: OPTIMUM GUARD COVERS AND m-WATCHMEN ROUTES FOR RESTRICTED POLYGONS
Recommended article: Routing in a polygonal terrain with the shortest beacon watchtower
Recommended article: Approximating Watchman Routes
Recommended article: Computing a shortest watchman path in a simple polygon in polynomial-time
description: scientific article; zbMATH DE number 1299797