

























Abstract:Given a point set, mostly a grid in our case, we seek upper and lower bounds on the number of curves that are needed to cover the point set. We say a curve covers a point if the curve passes through the point. We consider such coverings by monotonic curves, lines, orthoconvex curves, circles, etc. We also study a problem that is converse of the covering problem -- if a set of $n^2$ points in the plane is covered by $n$ lines then can we say something about the configuration of the points?
From: Pritam Majumder [view email]
[v1]
Tue, 29 Jul 2025 12:42:04 UTC (515 KB)
[v2]
Tue, 4 Nov 2025 09:14:49 UTC (515 KB)
[v3]
Sat, 13 Jun 2026 06:08:48 UTC (516 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。