Paul Horn

most citedOrtho-unit polygons can be guarded with at most

⌊ \frac{n - 4}{8} ⌋

guards

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

cs.CG2025

Matching random colored points with rectangles (Corrigendum)

Josué Corujo, Paul Horn, Pablo Pérez-Lantero

Given $n > 0$ , let $S \subset [0, 1]^{2}$ be a set of $n$ points, chosen uniformly at random. Let $R \cup B$ be a random partition, or coloring, of $S$ in which each point of $S$ is inclu…

cs.CG2022★ 1 cited

Ortho-unit polygons can be guarded with at most $⌊ \frac{n - 4}{8} ⌋$ guards

J. M. Díaz-Báñez, P. Horn, M. A. Lopez +5

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 pol…

Matching random colored points with rectangles (Corrigendum)

Ortho-unit polygons can be guarded with at most ⌊8n−4​⌋ guards

Ortho-unit polygons can be guarded with at most $⌊ \frac{n - 4}{8} ⌋$ guards