Kumar, PP and Madhavan, CEV (1993) Shortest watchman tours in weak visibility polygons. In: CCCG. Proceedings of the Fifth Canadian Conference on Computational Geometry, 5-9 Aug. 1993, Waterloo, Ont., Canada, pp. 91-96.
Full text not available from this repository. (Request a copy)
Official URL: http://arnetminer.org/viewpub.do?pid=82137
Abstract
An $O(n^4loglogn)$ algorithm for shortest watchman tour (SWT) problem for simple polygons, given a starting point on the boundary of the polygon is proposed by W.P. Chin and S. Ntafos. The problem of finding the SWT in general polygons when the starting point is not specified is open. We develop an $O(n^{10})$ algorithm for the SWT problem in weak visibility polygons, with no assumption on the starting point.
| Item Type: | Conference Paper |
|---|---|
| Publisher: | University of Waterloo |
| Additional Information: | Copyright of this article belongs to University of Waterloo. |
| Keywords: | shortest watchman tours;weak visibility polygons;simple polygons;general polygons |
| Department/Centre: | Division of Electrical Sciences > Computer Science & Automation |
| Date Deposited: | 10 Jan 2008 |
| Last Modified: | 12 Jan 2012 06:30 |
| URI: | http://eprints.iisc.ac.in/id/eprint/11097 |
Actions (login required)
 |
View Item |
