Galleries, light matchings and visibility graphs
Part of the Lecture Notes in Computer Science book series (LNCS, volume 382)
- 657 Downloads
KeywordsLine Segment Maximum Match Dual Graph Visibility Graph Convex Region
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 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
© Springer-Verlag Berlin Heidelberg 1989