Computing k-Link Visibility Polygons in Environments with a Reflective Edge
Salma Sadat Mahdavi, Ali Mohades, Bahram Kouhestani · 2011
In this paper we consider the k-link visibility polygon of an object inside a polygonal environment with a reflective edge called a mirror. The k-link visibility polygon of an object inside a polygon P is the set of all points in P, which are visible to some points of that object with at most k −1 intermediate points, under the property that consecutive intermediate points are mutually visible. We propose an optimal linear time algorithm for computing the k-link visibility polygon of an object inside a polygon P with a reflective edge. The object can be a point, a segment or a simple polygon. We observed that in computing k-link visibility polygons the mirror can affect in only two levels. We explain how to handle these levels efficiently to achieve an optimal algorithm. 1