Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Tight bounds for the rectangular art gallery problem

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 1991)

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

Included in the following conference series:

  • 226 Accesses

Abstract

Consider a rectangular art gallery, subdivided into n rectangular rooms; any two adjacent rooms have a door connecting them. We show that ⌈n/2⌋ guards are always sufficient to protect all rooms in a rectangular art gallery; furthermore, their positioning can be determined in O(n) time. We show that the optimal positioning of the guards can be determined in linear time. We extend the result by proving that in an arbitrary orthogonal art gallery (not necessarily convex, possibly having holes) with n rectangular rooms and k walls, ⌈(n + k)/2⌋ guards are always sufficient and occasionally necessary to guard all the rooms in our gallery. A linear time algorithm to find the positioning of the guards is obtained.

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.

Similar content being viewed by others

References

  1. N. Chiba and T. Nishizeki, The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs, J. Algorithms, V.10 (2) (1989), 187–212.

    Google Scholar 

  2. B. Grunbaum, Convex polytopes, J. Weily & Sons, 1967.

    Google Scholar 

  3. B. Grunbaum and J. O'Rourke, 1983 (see [5].).

    Google Scholar 

  4. T. Nishizeki, Lower bounds on cardinality of the maximum matchings of planar graphs, Carnegie Mellon Tech. Report, 1977.

    Google Scholar 

  5. J. O'Rourke, Art gallery theorems and algorithms, Oxford U. Press, 1987.

    Google Scholar 

  6. W. Tutte, A theorem on planar graphs, Trans. Amer. Math. Soc. 82 (1956), 99–116.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. U. Qucbcc, Hull, Quebec, Canada

    J. Czyzowicz

  2. U. Aulonoma Metropolitana-I, Mexico

    E. Rivera-Campo

  3. Carleton U., Ottawa, Canada

    N. Santoro

  4. U. Ottawa, Canada

    J. Urrutia

  5. U. Haifa, Israel

    J. Zaks

Authors
  1. J. Czyzowicz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. Rivera-Campo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. N. Santoro
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. J. Urrutia
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. J. Zaks
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gunther Schmidt Rudolf Berghammer

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Czyzowicz, J., Rivera-Campo, E., Santoro, N., Urrutia, J., Zaks, J. (1992). Tight bounds for the rectangular art gallery problem. In: Schmidt, G., Berghammer, R. (eds) Graph-Theoretic Concepts in Computer Science. WG 1991. Lecture Notes in Computer Science, vol 570. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55121-2_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-55121-2_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55121-8

  • Online ISBN: 978-3-540-46735-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation