An approximate algorithm for solving the watchman route problem

13Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The watchman route problem (WRP) was first introduced in 1988 and is defined as follows: How to calculate a shortest route completely contained inside a simple polygon such that any point inside this polygon is visible from at least one point on the route? So far the best known result for the WRP is an runtime algorithm (with inherent numerical problems of its implementation). This paper gives an approximate algorithm for WRP by using a rubberband algorithm, where n is the number of vertices of the simple polygon, k the number of essential cuts, ε the chosen accuracy constant for the minimization of the calculated route, and κ(ε) equals the length of the initial route minus the length of the calculated route, divided by ε. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Li, F., & Klette, R. (2008). An approximate algorithm for solving the watchman route problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4931 LNCS, pp. 189–206). https://doi.org/10.1007/978-3-540-78157-8_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free