by Li, F and Klette, R
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.
Reference:
An approximate algorithm for solving the watchman route problem (Li, F and Klette, R), In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 4931 LNCS, 2008.
Bibtex Entry:
@inproceedings{li2008anproblem,
author = "Li, F and Klette, R",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "189--206",
title = "An approximate algorithm for solving the watchman route problem",
volume = "4931 LNCS",
year = "2008",
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.",
doi = "10.1007/978-3-540-78157-8_15",
isbn = "3540781560",
isbn = "9783540781561",
issn = "0302-9743",
eissn = "1611-3349",
keyword = "Computational geometry",
keyword = "Euclidean shortest path",
keyword = "Rubberband algorithm",
keyword = "Simple polygon",
keyword = "Visual inspection",
keyword = "Watchman Route Problem",
language = "eng",
}