The reviewed record of science sign in
Pith

arxiv: 2201.01286 · v1 · pith:3RGXC2P7 · submitted 2022-01-04 · cs.CG

Catching Polygons

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:3RGXC2P7record.jsonopen to challenge →

classification cs.CG
keywords arrangementlinesaspectoptimalevenlyratiorectanglesome
0
0 comments X
read the original abstract

Consider an arrangement of $k$ lines intersecting the unit square. There is some minimum scaling factor so that any placement of a rectangle with aspect ratio $1 \times p$ with $p\geq 1$ must non-transversely intersect some portion of the arrangement or unit square. Assuming the lines of the arrangement are axis-aligned, we show the optimal arrangement depends on the aspect ratio of the rectangle. In particular, the optimal arrangement is either evenly spaced parallel lines or an evenly spaced grid of lines. We present the precise aspect ratios of rectangles for which each of the two nets is optimal.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.