Partial Visibility Polygon with Semi-Transparent Objects
Mostafa Nouri-Baygi, Mohammad Ghodsi · European Workshop on Computational Geometry · 2010
In this paper, we study partial visibility (or pvisibility) of a scene containing semi-transparent (convex) obstacles through which the light can pass partly. We deflne the p-visibility polygon and give algorithms to compute it for any query point. Then, we use the same technique to update the p-visibility polygon of a moving point, and to compute the maximum number of intersected objects by a ray emanating from a query point.