
doi: 10.1137/0218055
The paper contributes to geometric selection problems. The main emphasis is on developing optimal algorithm for computing the k-th largest (smallest) slope determined by given plane point-set. The algorithm makes use of parametric search technique of \textit{N. Megiddo} [J. Assoc. Comput. Mach. 30, 852-865 (1983; Zbl 0627.68034)] with the very interesting improvement by means of approximate ranking.
Information storage and retrieval of data, Analysis of algorithms and problem complexity, slope selection, computational geometry, Searching and sorting, parametric search
Information storage and retrieval of data, Analysis of algorithms and problem complexity, slope selection, computational geometry, Searching and sorting, parametric search
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 75 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 1% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
