Preview
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.
S. Fisk (1978) A short proof of Chvátal's watchman theorem, J. Comb. Theory, Ser. B 24, 374.
S. Foldes, I. Rival and J. Urrutia (1988) Light sources, obstructions and spherical orders, University of Ottawa Technical Report TR-88-23.
R. Honsberger (1986) Mathematical Gems II, Math. Assoc. of America, 104–110.
J. Kahn, M. Klawe and D. Kleitman (1973) Traditional galleries required fewer watchmen, SIAM J. Alg. Disc. Math. 4, 194–206.
J. O'Rourke (1987) Art Gallery Theorems and Algorithms, Oxford University Press.
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.
J. Urrutia and J. Zaks (1988) Illuminating convex sets on the plane. In preparation.
Author information
Authors and Affiliations
Editor information
Rights 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