Indexed metadata

Curves, points, incidences and covering

Arijit Bishnu, Mathew Francis, Pritam Majumder

Source record

Source: Crossref

Published: Sep 7, 2026

DOI: 10.46298/dmtcs.16899

Open original source ↗

Source 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 n2n^2 points in the plane is covered by nn lines then can we say something about the configuration of the points?

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.