Given a simple polygon $\mathnormal{P}$, two points in $\mathnormal{P}$ are said to be visible if they can be connected by a line segment contained in $\mathnormal{P}$. Since a line segment can be regarded as an arc of infinite radius, the notion of visibility can be generalized as follows : two points in $\mathnormal{P}$ are circularly visible if there exists an arc contained in $\mathnormal{P}$ joining them. In this paper we represent a linear time algorithm for constructing the potion of $\mathnormal{P}$ that can be circularly visible from a fixed point lying inside $\mathnormal{P}$.
