Tight Kernels for Covering with Points and Polynomials

Jean-Daniel Boissonnat (1) , Kunal Dutta (1) , Arijit Ghosh (2) , Sudeshna Kolay (3)

1 DATASHAPE - Understanding the Shape of Data
2 ACMU - Advanced Computing and Microelectronics Unit [Kolkata]
3 TU/e - Eindhoven University of Technology [Eindhoven]

The Point Hyperplane Cover problem in $R d$ takes as input a set of $n$ points in $R d$ and a positive integer $k$. The objective is to cover all the given points with a set of at most $k$ hyperplanes. The D-Polynomial Points Cover problem in $R d$ takes as input a family $F$ of D-degree polynomials from a vector space $R$ in $R d$ , and determines whether there is a set of at most $k$ points in $R d$ that hit all the polynomials in $F$. Here, a point p is said to hit a polynomial $f$ if $f (p) = 0$. For both problems, we exhibit tight kernels where $k$ is the parameter. We also exhibit a tight kernel for the Projective Point Hyperplane Cover problem, where the hyperplanes that are allowed to cover the points must all contain a fixed point, and the fixed point cannot be included in the solution set of points.

Mots clés: Nonnumerical Algorithms and Problems; Incidence Geometry; Tight Kernel Lower bounds; Hyperplanes; Bounded; Degree polynomials

Domaines: Géométrie algorithmique [cs.CG]

Jean-Daniel Boissonnat, Kunal Dutta, Arijit Ghosh, Sudeshna Kolay. Tight Kernels for Covering with Points and Polynomials. 2017. ⟨hal-01518562⟩