Optimal Parallel Algorithm for Visibility of a Simple Polygon from a Point

Abstract

We present a parallel algorithm for computing the visible portion of a simple polygonal chain with <italic>n</italic> vertices from a point in the plane. The algorithm runs in <italic>&Ogr;</italic>(log <italic>n</italic>) time using <italic>&Ogr;</italic>(<italic>n</italic>/ log <italic>n</italic>) processors in the CREW-PRAM computational model, and hence is asymptomatically optimal.

DOI: 10.1145/73833.73846

Extracted Key Phrases

3 Figures and Tables

Cite this paper

@inproceedings{Atallah1989OptimalPA, title={Optimal Parallel Algorithm for Visibility of a Simple Polygon from a Point}, author={Mikhail J. Atallah and Danny Ziyi Chen}, booktitle={Symposium on Computational Geometry}, year={1989} }