An Optimal-Time Algorithm for Slope Selection
From MaRDI portal
Publication:3835020
DOI10.1137/0218055zbMath0678.68033OpenAlexW1993949040WikidataQ55954535 ScholiaQ55954535MaRDI QIDQ3835020
William Steiger, Jeffrey S. Salowe, Endre Szemerédi, Richard John Cole
Publication date: 1989
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0218055
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Information storage and retrieval of data (68P20)
Related Items
Algorithms for ham-sandwich cuts, \(k\)-violation linear programming, Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem, Incomplete generalized \(L\)-statistics, Efficient piecewise-linear function approximation using the uniform metric, Parametric search made practical, Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain, Selecting distances in arrangements of hyperplanes spanned by points., Optimal slope selection via cuttings, Linear-time algorithms for parametric minimum spanning tree problems on planar graphs, The multi-weighted spanning tree problem, Decomposable multi-parameter matroid optimization problems., A center transversal theorem for hyperplanes and applications to graph drawing, Some variations on constrained minimum enclosing circle problem, Partitioning arrangements of lines. I: An efficient deterministic algorithm, Construction of \(\epsilon\)-nets, The complexity of hyperplane depth in the plane, A note on searching line arrangements and applications, On the performance of the ICP algorithm, THE ALIGNED K-CENTER PROBLEM, Randomized optimal algorithm for slope selection, Efficient algorithms for maximum regression depth, A pseudo-algorithmic separation of lines from pseudo-lines, Geometric pattern matching under Euclidean motion, Repeated median and hybrid filters, Optimal slope selection via expanders, Model-based probing strategies for convex polygons, Proximity problems on line segments spanned by points, Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses, Efficient algorithms for the sum selection problem and \(k\) maximum sums problem, Computing balanced convex partitions of lines, Minimizing the Maximum Moving Cost of Interval Coverage, MINKOWSKI SUM SELECTION AND FINDING, A practical approximation algorithm for the LMS line estimator, Linear-time algorithms for parametric minimum spanning tree problems on planar graphs, Counting and representing intersections among triangles in three dimensions, Detection of Lines by Combinatorial Optimization, Algorithms for bichromatic line-segment problems and polyhedral terrains, Space-time trade-offs for some ranking and searching queries, Optimal point movement for covering circular regions
