Optimal slope selection via expanders

Matthew J. Katz, Micha Sharir

Research output: Contribution to journalArticlepeer-review

32 Scopus citations

Abstract

Given n points in the plane and an integer k, the slope selection problem is to find the pair of points whose connecting line has the kth smallest slope. (In dual setting, given n lines in the plane, we want to find the vertex of their arrangement with the kth smallest x-coordinate.) Cole et al. have given an O(n log n) solution (which is optimal), using the parametric searching technique of Megiddo. We obtain another optimal (deterministic) solution that does not depend on parametric searching and uses expander graphs instead. Our solution is somewhat simpler than that of [6] and has a more explicit geometric interpretation.

Original languageEnglish
Pages (from-to)115-122
Number of pages8
JournalInformation Processing Letters
Volume47
Issue number3
DOIs
StatePublished - 14 Sep 1993
Externally publishedYes

Keywords

  • Computational geometry
  • algorithms
  • design of algorithms

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Optimal slope selection via expanders'. Together they form a unique fingerprint.

Cite this