L. Gewali and S. C. Ntafos. Watchman routes in the presence of a pair of convex polygons. Information Sciences, 105(1-4):123--149, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Geometric Shortest Paths and Network Optimization - Mitchell (1998) (39 citations) (Correct)
.... P ; see also Gewali et al. 168] There have been several other results on generalizations and variations of the watchman route problem, including watchman routes in weak visibility polygons [245] in spiral polygons [302] external to a simple polygon [305] external to two convex polygons [170], under limited visibility distance [304] and for multiple watchmen [85, 297, 301] in restricted simple polygons) Also, minimum link watchman tours have been studied. In simple polygons, Alsuwaiyel and Lee [18, 19] show that the problem is NP hard and give an O(1) approximation algorithm. In ....
L. P. Gewali and S. Ntafos. Watchman routes in the presence of a pair of convex polygons. In Proc. 7th Canad. Conf. Comput. Geom., pages 127--132, 1995.
On the Complexity of Approximating TSP with Neighborhoods and .. - Safra, Schwartz (Correct)
No context found.
L. Gewali and S. C. Ntafos. Watchman routes in the presence of a pair of convex polygons. Information Sciences, 105(1-4):123--149, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC