Finding Points in General Position
Computational Geometry
2017-06-07 v3
Abstract
We study computational aspects of the General Position Subset Selection problem defined as follows: Given a set of points in the plane, find a maximum-cardinality subset of points in general position. We prove that General Position Subset Selection is NP-hard, APX-hard, and give several fixed-parameter tractability results as well as a subexponential running time lower bound based on the Exponential Time Hypothesis.
Cite
@article{arxiv.1508.01097,
title = {Finding Points in General Position},
author = {Vincent Froese and Iyad Kanj and André Nichterlein and Rolf Niedermeier},
journal= {arXiv preprint arXiv:1508.01097},
year = {2017}
}
Comments
17 pages, improved problem kernel wrt. dual parameter h, added a figure