Optimal parallel algorithm for visibility of a simple polygon from a point
Mikhail J. Atallah, D. Z. Chen · 1989
We present a parallel algorithm for computing the visible portion of a simple polygonal chain with n vertices from a point in the plane. The algorithm runs in Ο(log n) time using Ο(n/ log n) processors in the CREW-PRAM computational model, and hence is asymptomatically optimal.