単純多角形のサーチライトスケジューリング

抄録

科研費報告書収録論文(課題番号：09680320・基盤研究(C)(2)・H9～H10／研究代表者：西関, 隆夫／構造的グラフに対する効率的アルゴリズムの統一的設計法)
The searchlight scheduling problem is to search robbers moving in a simple polygon by searchlights. Each of the searchlights is fixed at a point in the polygon, emits a single ray, and can change the direction of the ray continuously. In this paper, we presenta linear time algorithm to obtain a searchlight scheduling for a given polygon with searchlights on the boundary.