Finding Points in General Position

Vincent Froese,Iyad A Kanj,Andre Nichterlein,Rolf Niedermeier

International Journal of Computational Geometry and Applications（2017）

引用 26|浏览77

暂无评分

摘要

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.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要