Skip to main content
SpringerLink
Log in

A parallel algorithm for the visibility problem inside a simple polygon

  • Algorithms And Techniques
  • Chapter
  • First Online:
Recent Issues in Pattern Analysis and Recognition

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 399))

  • 180 Accesses

Abstract

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.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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

Author information

Authors and Affiliations

  1. Istituto di Analisi dei Sistemi e Informatica del CNR, Viale Manzoni 30, I-00185, Roma, Italy

    Paola Bertolazzi

  2. Department of Computer Sciences, Purdue University, 47907, West-Lafayette, IN

    Concettina Guerra

  3. Istituto di Analisi dei Sistemi e Informatica del CNR, Viale Manzoni 30, I-00185, Roma, Italy

    Silvio Salza

Authors
  1. Paola Bertolazzi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Concettina Guerra
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Silvio Salza
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Virginio Cantoni Reiner Creutzburg Stefano Levialdi G. Wolf

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bertolazzi, P., Guerra, C., Salza, S. (1989). A parallel algorithm for the visibility problem inside a simple polygon. In: Cantoni, V., Creutzburg, R., Levialdi, S., Wolf, G. (eds) Recent Issues in Pattern Analysis and Recognition. Lecture Notes in Computer Science, vol 399. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51815-0_43

Download citation

  • DOI: https://doi.org/10.1007/3-540-51815-0_43

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51815-0

  • Online ISBN: 978-3-540-46815-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation