Abstract
We present a parallel algorithm for computing the visible portion of a simple polygonal chain with ra vertices from a point in the plane. The algorithm runs in O(log n) time using O(n/ logn) processors in the CREW-PRAM computational model, and hence is asymptotically optimal.
Cite
CITATION STYLE
APA
Atallah, M. J., & Chen, D. Z. (1989). An optimal parallel algorithm for the visibility of a simple polygon from a point. In Proceedings of the Annual Symposium on Computational Geometry (Vol. Part F130124, pp. 114–123). Association for Computing Machinery. https://doi.org/10.1145/73833.73846
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free