Saved in:
Bibliographic Details
Main Authors: 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.
Format: Preprint
Published: 2022
Subjects:
Online Access:https://arxiv.org/abs/2208.12864
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915101336928256
author 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.
author_facet 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.
contents 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 \geq 12$ vertices can be guarded with at most $\lfloor \frac{n-4}{8} \rfloor$ guards, which is a tight bound.
format Preprint
id arxiv_https___arxiv_org_abs_2208_12864
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle Ortho-unit polygons can be guarded with at most $\lfloor \frac{n-4}{8} \rfloor$ guards
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.
Computational Geometry
Combinatorics
68
F.2.2
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 \geq 12$ vertices can be guarded with at most $\lfloor \frac{n-4}{8} \rfloor$ guards, which is a tight bound.
title Ortho-unit polygons can be guarded with at most $\lfloor \frac{n-4}{8} \rfloor$ guards
topic Computational Geometry
Combinatorics
68
F.2.2
url https://arxiv.org/abs/2208.12864