Kernelization of the Subset General Position problem in Geometry - Archive ouverte HAL Access content directly
Conference Papers Year :

Kernelization of the Subset General Position problem in Geometry

(1) , (1) , (2) , (3)
1
2
3

Abstract

In this paper, we consider variants of the Geometric Subset General Position problem. In defining this problem, a geometric subsystem is specified, like a subsystem of lines, hyperplanes or spheres. The input of the problem is a set of n points in R d and a positive integer k. The objective is to find a subset of at least k input points such that this subset is in general position with respect to the specified subsystem. For example, a set of points is in general position with respect to a subsystem of hyperplanes in R d if no d + 1 points lie on the same hyperplane. In this paper, we study the Hyperplane Subset General Position problem under two parameterizations. When parameterized by k then we exhibit a polynomial kernelization for the problem. When parameterized by h = n − k, or the dual parameter, then we exhibit polynomial kernels which are also tight, under standard complexity theoretic assumptions. We can also exhibit similar kernelization results for d-Polynomial Subset General Position, where a vector space of polynomials of degree at most d are specified as the underlying subsystem such that the size of the basis for this vector space is b. The objective is to find a set of at least k input points, or in the dual delete at most h = n − k points, such that no b + 1 points lie on the same polynomial. Notice that this is a generalization of many well-studied geometric variants of the Set Cover problem, such as Circle Subset General Position. We also study general projective variants of these problems. These problems are also related to other geometric problems like Subset Delaunay Triangulation problem.
Fichier principal
Vignette du fichier
main.pdf (462.24 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01583101 , version 1 (06-09-2017)

Identifiers

Cite

Jean-Daniel Boissonnat, Kunal Dutta, Arijit Ghosh, Sudeshna Kolay. Kernelization of the Subset General Position problem in Geometry. MFCS 2017 - 42nd International Symposium on Mathematical Foundations of Computer Science, Aug 2017, Alborg, Denmark. ⟨10.4230/LIPIcs.MFCS.2017.25⟩. ⟨hal-01583101⟩
163 View
140 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More