Given a simple polygon P with n vertices, the visibility polygon (VP) of a point q (VP(q)), or a segment pq (VP(pq)) inside P can be computed in linear time. We propose a linear time algorithm toâ€¦ (More)

We consider extending visibility polygon (V P ) of a given point q (V P (q)), inside a simple polygon P by converting some edges of P to mirrors. We will show that several variations of the problemâ€¦ (More)