### Abstract

Given n points in the plane and an integer k, the problem of selecting that pair of points that determines the line with the kth smallest or largest slope is considered. In the restricted case, where k is O(n), line sweeping gives an optimal, O(n log n)-time algorithm. For general k the parametric search technique of Megiddo is used to describe an O(n(log n)^{2})-time algorithm. This is modified to produce a new, optimal O(n log n)-time selection algorithm by incorporating an approximation idea.

Original language | English |
---|---|

Pages (from-to) | 792-810 |

Number of pages | 19 |

Journal | SIAM Journal on Computing |

Volume | 18 |

Issue number | 4 |

DOIs | |

Publication status | Published - Jan 1 1989 |

### ASJC Scopus subject areas

- Computer Science(all)
- Mathematics(all)

## Fingerprint Dive into the research topics of 'Optimal-time algorithm for slope selection'. Together they form a unique fingerprint.

## Cite this

Cole, R., Salowe, J. S., Steiger, W. L., & Szemeredi, E. (1989). Optimal-time algorithm for slope selection.

*SIAM Journal on Computing*,*18*(4), 792-810. https://doi.org/10.1137/0218055