NIST

slope selection

(classic problem)

Definition: Given a set of points in a plane and an integer k ≤ ( n OVER  2 ), find the line between pairs of points which has the kth smallest slope.

Note: Adapted from [AS98, page 416].

Author: PEB


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 17 December 2004.
HTML page formatted Fri Feb 23 10:06:08 2018.

Cite this as:
Paul E. Black, "slope selection", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/slopeselectn.html