A randomized algorithm for slope selection
MB Dillencourt, DM Mount… - International Journal of …, 1992 - World Scientific
MB Dillencourt, DM Mount, NS Netanyahu
International Journal of Computational Geometry & Applications, 1992•World ScientificA set of n distinct points in the plane defines lines by joining each pair of distinct points. The
median slope of these O (n2) lines was proposed by Theil as a robust estimator for the slope
of the line of best fit for the points. We present a randomized algorithm for selecting the k-th
smallest slope of such a set of lines which runs in expected O (n log n) time. An efficient
implementation of the algorithm and practical experience with the algorithm are discussed.
median slope of these O (n2) lines was proposed by Theil as a robust estimator for the slope
of the line of best fit for the points. We present a randomized algorithm for selecting the k-th
smallest slope of such a set of lines which runs in expected O (n log n) time. An efficient
implementation of the algorithm and practical experience with the algorithm are discussed.
A set of n distinct points in the plane defines lines by joining each pair of distinct points. The median slope of these O(n2) lines was proposed by Theil as a robust estimator for the slope of the line of best fit for the points. We present a randomized algorithm for selecting the k-th smallest slope of such a set of lines which runs in expected O(n log n) time. An efficient implementation of the algorithm and practical experience with the algorithm are discussed.
World ScientificShowing the best result for this search. See all results