A pseudo-algorithmic separation of lines from pseudo-lines

DOI10.1016/0020-0190(94)00201-9MaRDI QIDQ674001zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

analysis of algorithmscomputational complexitycomputational geometry

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40)

Cites work

• An Optimal-Time Algorithm for Slope Selection
• An upper bound on the number of planar K-sets
• How good is the information theory bound in sorting?
• scientific article; zbMATH DE number 431988 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 3895080 (Why is no real title available?)
• Lower bounds on the length of monotone paths in arrangements
• Multidimensional Sorting
• On the number of reduced decompositions of elements of Coxeter groups
• Sorting X + Y
• Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)

Cited in

(5)

• Necklaces, convolutions, and \(X+Y\)
• Ranked enumeration of conjunctive query results
• Hopcroft's problem, log* shaving, two-dimensional fractional cascading, and decision trees
• Ranked enumeration of conjunctive query results
• An algorithm for computing exact least-trimmed squares estimate of simple linear regression with constraints

This page was built for publication: A pseudo-algorithmic separation of lines from pseudo-lines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674001)