ABSTRACT
In this paper we consider the problem of computing the weak visibility polygon of a query line segment pq (or ) inside a given polygon . Our first algorithm runs in simple polygons and needs time and space in the preprocessing phase to report of any query line segment pq in time . We also give an algorithm to compute the weak visibility polygon of a query line segment in a non-simple polygon with pairwise-disjoint polygonal obstacles with a total of n vertices. Our algorithm needs time and space in the preprocessing phase and in query time of , in which is an output sensitive parameter of at most , and is the output size.
Disclosure statement
No potential conflict of interest was reported by the authors.