Kernelization of the subset general position problem in geometry
From MaRDI portal
Publication:5111239
DOI10.4230/LIPICS.MFCS.2017.25zbMATH Open1441.68263MaRDI QIDQ5111239FDOQ5111239
Arijit Ghosh, Sudeshna Kolay, Kunal Dutta, Jean-Daniel Boissonnat
Publication date: 26 May 2020
Recommendations
- Finding points in general position
- On the General Position Subset Selection Problem
- Applications of incidence bounds in point covering problems
- General position subsets and independent hyperplanes in \(d\)-space
- Tight kernels for covering and hitting: point hyperplane cover and polynomial point hitting set
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- Title not available (Why is that?)
- Parameterized Algorithms
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Topologically sweeping an arrangement
- Kernel bounds for disjoint cycles and disjoint paths
- Title not available (Why is that?)
- Covering things with things
- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
- Title not available (Why is that?)
- Better lower bounds on detecting affine and spherical degeneracies
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- Towards optimal and expressive kernelization for \(d\)-hitting set
- Corrigendum: Topologically sweeping an arrangement
- Point Line Cover
- On the General Position Subset Selection Problem
- General position subsets and independent hyperplanes in \(d\)-space
This page was built for publication: Kernelization of the subset general position problem in geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111239)
