Skip to search formSkip to main contentSkip to account menu

Watchman route problem

Known as: Watchman problem 
The Watchman Problem is an optimization problem in computational geometry where the objective is to compute the shortest route a watchman should take… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Given an orthogonal polygon $ P $ with $ n $ vertices, the goal of the watchman route problem is finding a path $ S $ of the… 
2011
2011
The Watchman Route Problem is an optimization problem in computational geometry where the objective is to compute the shortest… 
2011
2011
This work deals with geometric problems and the use of limited capability agents for these problems. Exploration and guarding… 
2008
2008
Motion Analysis.- Dynamic Multiresolution Optical Flow Computation.- Particle-Based Belief Propagation for Structure from Motion… 
Review
2001
Review
2001
The Shortest Watchman Route Problem, namely ’Given a polygon find the shortest route in the polygon with the property that each… 
1993
1993
A ground stone hatchet head was found in the excavation of the Sirius which was wrecked off Norfolk Island in 1790. This paper…