Linear Programming and Convex Hulls Made Easy

@inproceedings{Seidel1990LinearPA,
  title={Linear Programming and Convex Hulls Made Easy},
  author={Raimund Seidel},
  booktitle={Symposium on Computational Geometry},
  year={1990}
}
We present two randomized algorithms. One solves linear programs involving <italic>m</italic> constraints in <italic>d</italic> variables in expected time <italic>&Ogr;</italic>(<italic>m</italic>). The other constructs convex hulls of <italic>n</italic> points in R<italic><supscrpt>d</supscrpt>, d</italic> > 3, in expected time <italic>&Ogr;</italic>(<italic>n</italic><supscrpt>⌈<italic>d</italic>/2⌉</supscrpt>). In both bounds <italic>d</italic> is considered to be a constant. In the linear… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 124 extracted citations

Similar Papers

Loading similar papers…