some results on computing the visibility of a query point inside polygons with holes

in this paper we consider the problem of computing the visibility polygon of a query point inside polygons with hoes. The goal is to perform this computation efficiently per query with more cost in the preprocessing phase our algorithm is based on solutions in 10 and 11 proposed for simple polygons in our solution the preprocessing is done in time On3logn to construct a data structure of size On3.

کلیدواژه ها:

visibility polygon ، visibility decomposition ، polygonwith holes