Computing the visibility area between two simple polygons in linear time
Elmar Langetepe, Rainer Penninger, Jan Tulke · 2010
We consider a visibility problem for two nonintersecting open or closed simple polygonal chains P and Q in the plane. The visibility area between P and Q is the union of all line segments pq where p lies on the boundary of P and q on the boundary of Q and pq does neither intersect with P nor with Q. We present an optimal linear time algorithm for computing this area. The given work generalizes known visibility results and has an application in computer aided construction management.