A parallel algorithm for the visibility problem inside a simple polygon

1. A. Aggarwal, B. Chazelle, L. Guibas, C. O'Dunlaing and C. Yap, ”Parallel Computational geometry”, Proc. 26th FOCS, 468–477, 1985.

   Google Scholar 

2. T. Asano, ”An efficient algorithm for finding the visibility polygon for a polygonal region with holes”, Trans. IECE-Japan, E-68, 557–559, 1985.

   Google Scholar 

3. T. Asano, H. Umeo, ”Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region”, Parallel Computing, 6, 209–217, 1988.

   Article  Google Scholar 

4. M. Atallah, M. T. Goodrich, ”Efficient solutions to some geometric problems”, Journal of Parallel and Distributed Computing, 3, 492–507, 1986.

   Article  Google Scholar 

5. H. E. Gindy, D. Avis, ”A linear algorithm for computing the visibility polygon from a point”, Journal of Algorithms, 2, 186–197, 1981.

   Article  Google Scholar 

6. R. E. Ladner, M. J. Fischer, ”Parallel prefix computation”, Journal ACM, 831–838, 1980.

   Google Scholar 

7. E. Lodi, L. Pagli, ”A VLSI algorithm for a visibility problem”, VLSI: Algorithms and Architectures, (P. Bertolazzi and F. Luccio eds.), North-Holland, 125–136, 1985.

   Google Scholar 

8. L. G. Valiant, ”Parallelism on comparison problems”, SIAM Journal on Computing, 348–355, 1975.

   Google Scholar 

9. C. A. Wang, Y. H. Tsin, ”An O(log n) time parallel algorithm for triangulating a set of points in the plane”, Information Processing Letters, 25, 55–60, 1987.

   Article  MathSciNet  Google Scholar 

Download references