Fast computation of shortest watchman routes in simple polygons
type: Item
instance of: scholarly article
title: Fast computation of shortest watchman routes in simple polygons
zbMATH Open document ID: 1003.68174
DOI: 10.1016/S0020-0190(00)00146-0
published in: Information Processing Letters
publication date: 2002-07-25T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 65D15
zbMATH DE Number: 1771784
zbMATH Keywords: watchman route problem
Wikidata QID: Q29304368
author: Xuehou Tan
MaRDI profile type: Publication
cites work: Finding an approximate minimum-link visibility path inside a simple polygon
cites work: Finding the shortest watchman route in a simple polygon
cites work: Optimum watchman routes
cites work: Shortest watchman routes in simple polygons
cites work: Q3138983
cites work: Concerning the time bounds of existing shortest watchman route algorithms
cites work: AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES
cites work: CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES"
full work available at URL: s0020-0190(00)00146-0
OpenAlex ID: W1974433908
Recommended article: Shortest watchman routes in simple polygons
Recommended article: Computing a shortest watchman path in a simple polygon in polynomial-time
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: Approximating a shortest watchman route
Recommended article: Optimal shortest path queries in a simple polygon
Recommended article: An improved algorithm for computing a shortest watchman route for lines
Recommended article: Approximate Shortest Paths in Simple Polyhedra
Recommended article: Shortest Path Queries in Polygonal Domains
Recommended article: Watchman routes in the presence of a pair of convex polygons
description: scientific article; zbMATH DE number 1771784