Guarding in a simple polygon☆
References (10)
Optimally computing the shortest weakly visible subedge of a simple polygon
J. Algorithms
(1996)- et al.
An algorithm for determine visibility of a simple polygon from an internal line segment
J. Algorithms
(1993) - et al.
Optimal linear-time algorithm for the shortest illuminating line segment in a polygon
- et al.
Finding all weakly-visible chords of a polygon in linear time
Nordic J. Comput.
(1994) Detecting the weak visibility of a simple polygon and related problems, Technical Report
(1987)
There are more references available in the full text version of this article.
Cited by (1)
Mobile anchor-assisted localization over android
2017, Wireless Networks
- ☆
Support in part by NSC grant NSC-87-2213-E-127007.
Copyright © 2000 Elsevier Science B.V. All rights reserved.