The Searchlight Scheduling Problem
- 1 December 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 19 (6) , 1024-1040
- https://doi.org/10.1137/0219070
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple PolygonSIAM Journal on Computing, 1988
- Computational complexity of art gallery problemsIEEE Transactions on Information Theory, 1986
- An alternate proof of the rectilinear art gallery theoremJournal of Geometry, 1983
- Traditional Galleries Require Fewer WatchmenSIAM Journal on Algebraic Discrete Methods, 1983
- An efficient algorithm for decomposing a polygon into star-shaped polygonsPattern Recognition, 1981
- A combinatorial theorem in plane geometryJournal of Combinatorial Theory, Series B, 1975