N. Marín

most citedOrtho-unit polygons can be guarded with at most

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

guards

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

collaborators

3 papers

math.CO2022

Crossing and intersecting families of geometric graphs on point sets

José Luis Álvarez-Rebollar, Jorge Cravioto-Lagos, Nestaly Marín +2

Let $S$ be a set of $n$ points in the plane in general position. Two line segments connecting pairs of points of $S$ cross if they have an interior point in common. Two vertex disj…

cs.CG2022

Optimal Placement of Base Stations in Border Surveillance using Limited Capacity Drones

S. Bereg, J. M. Díaz-Báñez, M. Haghpanah +8

Imagine an island modeled as a simple polygon $¶$ with $n$ vertices whose coastline we wish to monitor. We consider the problem of building the minimum number of refueling stations…

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…

Crossing and intersecting families of geometric graphs on point sets

Optimal Placement of Base Stations in Border Surveillance using Limited Capacity Drones

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