watchman route problem

CCCG
2007

104views Computational Geometry» more CCCG 2007»

Generalized Watchman Route Problem with Discrete View Cost

13 years 6 months ago

In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...

Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta

claim paper

Read More »

click to vote

CCCG
2010

180views Computational Geometry» more CCCG 2010»

Watchman route in a simple polygon with a rubberband algorithm

13 years 6 months ago

Download www.cs.umanitoba.ca

So far, the best result in running time for solving the fixed watchman route problem (i.e., shortest path for viewing any point in a simple polygon with given start point) is O(n3...

Fajie Li, Reinhard Klette

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers