You are currently offline. Some features of the site may not work correctly.

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