AN OPTIMAL ALGORITHM FOR FINDING THE EDGE VISIBILITY POLYGON UNDER LIMITED VISIBILITY

Abstract

Two points in a polygon P are said to be d-visible if the line segment l joining them is contained in P and the length of l is d or less. In applications such as computer graphics and robot vision, the notion of d-visibility is more suitable than the commonly used definition of visibility, which is equivalent to d-visibility with infinite d. We present an O(n) time algorithm for finding the d-visibility polygon from an edge e in P, where n is the number of vertices in P.