A RANDOMIZED ALGORITHM FOR SLOPE SELECTION
From MaRDI portal
Publication:5966682
DOI10.1142/S0218195992000020zbMath0761.68096OpenAlexW2100103289WikidataQ56607626 ScholiaQ56607626MaRDI QIDQ5966682
Nathan S. Netanyahu, Michael B. Dillencourt, David M. Mount
Publication date: 16 January 1993
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195992000020
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (22)
Algorithms for ham-sandwich cuts ⋮ \(k\)-violation linear programming ⋮ An approximation algorithm for least median of squares regression ⋮ A linear-time construction of the relative neighborhood graph within a histogram ⋮ Incomplete generalized \(L\)-statistics ⋮ Characterizing proximity trees ⋮ Selecting distances in arrangements of hyperplanes spanned by points. ⋮ Randomized algorithm for the sum selection problem ⋮ Optimal slope selection via cuttings ⋮ On reverse shortest paths in geometric proximity graphs ⋮ Efficient algorithms for maximum regression depth ⋮ On enclosing k points by a circle ⋮ Optimal slope selection via expanders ⋮ Proximity problems on line segments spanned by points ⋮ Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses ⋮ Computing balanced convex partitions of lines ⋮ ON ENUMERATING AND SELECTING DISTANCES ⋮ MINKOWSKI SUM SELECTION AND FINDING ⋮ A practical approximation algorithm for the LMS line estimator ⋮ Efficient randomized algorithms for some geometric optimization problems ⋮ Counting and representing intersections among triangles in three dimensions ⋮ Optimal point movement for covering circular regions
This page was built for publication: A RANDOMIZED ALGORITHM FOR SLOPE SELECTION
