Affiliation:
1. Praktische Informatik VI, Fernuniversit ä t — GH — Hagen, Elberfelder Str. 95, D-5800 Hagen, Germany
Abstract
Given a simple polygon in the plane with two distinguished vertices, s and g, is it possible for two guards to simultaneously walk along the two boundary chains from s to g in such a way that they are always mutually visible? We decide this question in time O (n log n) and in linear space, where n is the number of edges of the polygon. Moreover, we compute a walk of minimum length within time O(n log n+k), where k is the size of the output, and we prove that this is optimal.
Publisher
World Scientific Pub Co Pte Lt
Subject
Applied Mathematics,Computational Mathematics,Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science
Cited by
49 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献