Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. M. J. Atallah and D. Z. Chen. Optimal parallel algorithm for visibility of a simple polygon from a point. In Proc. 5th ACM Symp. on Computational Geometry, pages 114–123, 1989.
2. O. Berkman, B. Schieber, and U. Vishkin. Some Doubly Logarithmic Optimal Parallel Algorithms Based on Finding All Nearest Smaller Values. Technical Report UMIACS-TR-88-79, Institute for Advance Computer Studies, University of Maryland, 1988.
3. D. Z. Chen. An optimal parallel algorithm for detecting weak visibility of a simple polygon. In Proc. 8th ACM Symp. on Computational Geometry, pages 63–72, 1992.
4. R. Cole and M. Goodrich. Optimal parallel algorithms for polygon and point-set problems. In Proc. 4th ACM Symp. on Computational Geometry, pages 201–210, 1988.
5. Herbert Edelsbrunner. Algorithms in Combinatorial Geometry. Springer Verlag, EATCS monographs on theoretical computer science, 1987.