An algorithm for finding a watchman route with minimum links in the characteristic polygons


The KIPS Transactions:PartA, Vol. 9, No. 4, pp. 595-602, Dec. 2002
10.3745/KIPSTA.2002.9.4.595,   PDF Download:

Abstract

The watchman routes which an watchman patrols the interior of polygon moving along the route are classified to minimum length or minimum links. The watchman route with minimum links has minimum changes of direction in process. In this paper, we present an algorithm with O (n2 ) time for finding the watchman route with minimum links in the weakly visible polygons which have specific property.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. R. Ryu, "An algorithm for finding a watchman route with minimum links in the characteristic polygons," The KIPS Transactions:PartA, vol. 9, no. 4, pp. 595-602, 2002. DOI: 10.3745/KIPSTA.2002.9.4.595.

[ACM Style]
Sang Ryul Ryu. 2002. An algorithm for finding a watchman route with minimum links in the characteristic polygons. The KIPS Transactions:PartA, 9, 4, (2002), 595-602. DOI: 10.3745/KIPSTA.2002.9.4.595.