Skip to main content
SpringerLink
Log in

An addendum to parallel methods for visibility and shortest-path problems in simple polygons

  • Published:
Algorithmica Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. 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.

    Google Scholar 

  2. M. T. Goodrich, S. Shauck, and S. Guha, Parallel Methods for Visibility and Shortest-Path Problems in Simple Polygons,Algorithmica,8, 1992, 461–486.

    Google Scholar 

  3. 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.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Johns Hopkins University, 21218, Baltimore, MD, USA

    Michael T. Goodrich

  2. Westinghouse Electric Corporation, P.O. Box 746, M/S 463, 21203, Baltimore, MD, USA

    Steven B. Shauck

  3. Department of Electrical Engineering and Computer Science, University of Wisconsin at Milwaukee, 53201, Milwaukee, WI, USA

    Sumanta Guha

Authors
  1. Michael T. Goodrich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Steven B. Shauck
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sumanta Guha
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01187038

Keywords

Search

Navigation