Randomized optimal algorithm for slope selection
From MaRDI portal
Publication:1182097
DOI10.1016/0020-0190(91)90177-JzbMATH Open0735.68087WikidataQ56607631 ScholiaQ56607631MaRDI QIDQ1182097FDOQ1182097
Authors: Jiří Matoušek 
Publication date: 27 June 1992
Published in: Information Processing Letters (Search for Journal in Brave)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Sorting in \(c \log n\) parallel steps
- Title not available (Why is that?)
- An Optimal-Time Algorithm for Slope Selection
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
Cited In (28)
- Title not available (Why is that?)
- Some variations on constrained minimum enclosing circle problem
- Selecting distances in arrangements of hyperplanes spanned by points.
- Algorithms for ham-sandwich cuts
- Indexing moving points
- Efficient randomized algorithms for some geometric optimization problems
- Derivation of Passing-Bablok regression from Kendall's tau
- A RANDOMIZED ALGORITHM FOR SLOPE SELECTION
- An approximation algorithm for least median of squares regression
- A practical approximation algorithm for the LMS line estimator
- On enclosing k points by a circle
- THE ALIGNED K-CENTER PROBLEM
- Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses
- \(k\)-violation linear programming
- Efficient algorithms for maximum regression depth
- Randomized algorithm for the sum selection problem
- Proximity problems on line segments spanned by points
- An Optimal-Time Algorithm for Slope Selection
- Incomplete generalized \(L\)-statistics
- Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications
- On reverse shortest paths in geometric proximity graphs
- Computing balanced convex partitions of lines
- Optimal slope selection via expanders
- Counting and representing intersections among triangles in three dimensions
- Minkowski sum selection and finding
- ON ENUMERATING AND SELECTING DISTANCES
- Diameter, width, closest line pair, and parametric searching
- Optimal slope selection via cuttings
This page was built for publication: Randomized optimal algorithm for slope selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1182097)
