论文信息 - A parallel Algorithm for the visibility problem inside a simple polygon

A parallel Algorithm for the visibility problem inside a simple polygon

In this paper we present a parallel algorithm for computing the visibility polygon of a polygon P from a given point internal to P. The algorithm is based on a divide and conquer strategy and achieves a complexity of O(logn) on a PRAM with O(n) processors.

[1] Leonidas J. Guibas,et al. Parallel computational geometry , 1988, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[2] Leslie G. Valiant,et al. Parallelism in Comparison Problems , 1975, SIAM J. Comput..

[3] T. Asano. An Efficient Algorithm for Finding the Visibility Polygon for a Polygonal Region with Holes , 1985 .

[4] Yung H. Tsin,et al. An O(log n) Time Parallel Algorithm for Triangulating a Set of Points in the Plane , 1987, Inf. Process. Lett..

[5] Mikhail J. Atallah,et al. Efficient Parallel Solutions to Some Geometric Problems , 1986, J. Parallel Distributed Comput..

[6] David Avis,et al. A Linear Algorithm for Computing the Visibility Polygon from a Point , 1981, J. Algorithms.

[7] Hiroshi Umeo,et al. Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region , 1987, Parallel Comput..