Finding Points in General Position

@article{Froese2016FindingPI,
  title={Finding Points in General Position},
  author={Vincent Froese and Iyad A. Kanj and Andr{\'e} Nichterlein and Rolf Niedermeier},
  journal={Int. J. Comput. Geom. Appl.},
  year={2016},
  volume={27},
  pages={277-296}
}
  • Vincent Froese, Iyad A. Kanj, +1 author Rolf Niedermeier
  • Published 2016
  • Mathematics, Computer Science
  • Int. J. Comput. Geom. Appl.
  • 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. 

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 23 CITATIONS

    An improved lower bound for general position subset selection

    VIEW 3 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    An Improved Algorithm for General Position Subset Selection

    VIEW 3 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Clique-Width of Point Configurations

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Enumerating Collinear Points in Higher Dimensions

    VIEW 1 EXCERPT
    CITES BACKGROUND

    A Practical Algorithm for Enumerating Collinear Points

    VIEW 1 EXCERPT
    CITES BACKGROUND

    FILTER CITATIONS BY YEAR

    2017
    2020

    CITATION STATISTICS

    • 2 Highly Influenced Citations

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 37 REFERENCES