Corpus ID: 227305594

Near-Optimal Algorithms for Point-Line Covering Problems

@article{Chen2020NearOptimalAF,
  title={Near-Optimal Algorithms for Point-Line Covering Problems},
  author={J. Chen and Qin Huang and Iyad A. Kanj and Ge Xia},
  journal={ArXiv},
  year={2020},
  volume={abs/2012.02363}
}
We study fundamental point-line covering problems in computational geometry, in which the input is a set $S$ of points in the plane. The first is the Rich Lines problem, which asks for the set of all lines that each covers at least $\lambda$ points from $S$, for a given integer parameter $\lambda \geq 2$; this problem subsumes the 3-Points-on-Line problem and the Exact Fitting problem, which -- the latter -- asks for a line containing the maximum number of points. The second is the NP-hard… Expand

Figures from this paper

References

SHOWING 1-10 OF 52 REFERENCES
Covering a Set of Points with a Minimum Number of Lines
  • 26
  • Highly Influential
  • PDF
Applications of incidence bounds in point covering problems
  • 8
  • PDF
Reduction rules deliver efficient FPT-algorithms for covering points with lines
  • 6
  • Highly Influential
  • PDF
Hardness of Set Cover with Intersection 1
  • 79
  • PDF
Algorithms for Polytope Covering and Approximation
  • 127
Fpt-Algorithms for Minimum-Bends Tours
  • 8
  • PDF
A parameterized algorithm for the hyperplane-cover problem
  • 16
  • PDF
On the complexity of locating linear facilities in the plane
  • 187
Almost optimal set covers in finite VC-dimension
  • 502
  • PDF
A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope
  • 4
  • Highly Influential
  • PDF
...
1
2
3
4
5
...