MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Ortho-Unit Polygons can be Guarded with at most n - 4 8 Guards

Author(s)
Díaz-Báñez, J. M.; Horn, P.; Lopez, M. A.; Marín, N.; Ramírez-Vigueras, A.; Solé-Pi, O.; Stevens, A.; Urrutia, J.; ... Show more Show less
Thumbnail
Download373_2024_2880_ReferencePDF.pdf (Embargoed until: 2025-12-29, 4.506Mb)
Publisher Policy

Publisher Policy

Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.

Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
Abstract
Abstract An orthogonal polygon is called an ortho-unit polygon if its vertices have integer coordinates, and all of its edges have length one. In this paper we prove that any ortho-unit polygon with n ≥ 12 vertices can be guarded with at most ⌊ n - 4 8 ⌋ guards, which is a tight bound.
Date issued
2024-12-29
URI
https://hdl.handle.net/1721.1/159047
Department
Massachusetts Institute of Technology. Department of Mathematics
Journal
Graphs and Combinatorics
Publisher
Springer Japan
Citation
Díaz-Báñez, J.M., Horn, P., Lopez, M.A. et al. Ortho-Unit Polygons can be Guarded with at most n - 4 8 Guards. Graphs and Combinatorics 41, 15 (2025).
Version: Author's final manuscript

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.