A pseudo-algorithmic separation of lines from pseudo-lines
From MaRDI portal
Publication:674001
DOI10.1016/0020-0190(94)00201-9zbMath1004.68603OpenAlexW1988985328MaRDI QIDQ674001
William Steiger, Ileana Streinu
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(94)00201-9
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (2)
Necklaces, convolutions, and \(X+Y\) ⋮ An algorithm for computing exact least-trimmed squares estimate of simple linear regression with constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounds on the length of monotone paths in arrangements
- On the number of reduced decompositions of elements of Coxeter groups
- Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
- An upper bound on the number of planar \(K\)-sets
- How good is the information theory bound in sorting?
- Multidimensional Sorting
- An Optimal-Time Algorithm for Slope Selection
- Sorting X + Y
This page was built for publication: A pseudo-algorithmic separation of lines from pseudo-lines
