Skip to main content

Galleries, light matchings and visibility graphs

  • Conference paper
  • First Online:
Algorithms and Data Structures (WADS 1989)

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

Included in the following conference series:

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • V. Chvátal (1975) A combinatorial theorem in plane geometry, J. Comb. Theory, Ser. B 18, 39–41.

    Google Scholar 

  • S. Fisk (1978) A short proof of Chvátal's watchman theorem, J. Comb. Theory, Ser. B 24, 374.

    Google Scholar 

  • S. Foldes, I. Rival and J. Urrutia (1988) Light sources, obstructions and spherical orders, University of Ottawa Technical Report TR-88-23.

    Google Scholar 

  • R. Honsberger (1986) Mathematical Gems II, Math. Assoc. of America, 104–110.

    Google Scholar 

  • J. Kahn, M. Klawe and D. Kleitman (1973) Traditional galleries required fewer watchmen, SIAM J. Alg. Disc. Math. 4, 194–206.

    Google Scholar 

  • J. O'Rourke (1987) Art Gallery Theorems and Algorithms, Oxford University Press.

    Google Scholar 

  • R.E. Tarjan and C.J. Van Wyk (1988) An O(n log log n)-time algorithm for triangulating simple polygons, SIAM J. Com. 17, 143–178.

    Google Scholar 

  • J. Urrutia and J. Zaks (1988) Illuminating convex sets on the plane. In preparation.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

F. Dehne J. -R. Sack N. Santoro

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Czyzowicz, J., Rival, I., Urrutia, J. (1989). Galleries, light matchings and visibility graphs. In: Dehne, F., Sack, J.R., Santoro, N. (eds) Algorithms and Data Structures. WADS 1989. Lecture Notes in Computer Science, vol 382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51542-9_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-51542-9_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51542-5

  • Online ISBN: 978-3-540-48237-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics