References
M. J. Atallah, R. Cole, and M. T. Goodrich, Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms,SIAM J. Comput., 18(3), 1989, 499–532.
M. T. Goodrich, S. Shauck, and S. Guha, Parallel Methods for Visibility and Shortest-Path Problems in Simple Polygons,Algorithmica,8, 1992, 461–486.
C. Rüb, Computing Intersections and Arrangements for Red-Blue Curve Segments in Parallel,Proc. 4th Canadian Conference on Computational Geometry, 1992, pp. 115–120.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Goodrich, M.T., Shauck, S.B. & Guha, S. An addendum to parallel methods for visibility and shortest-path problems in simple polygons. Algorithmica 9, 515–516 (1993). https://doi.org/10.1007/BF01187038
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01187038