Small-dimensional linear programming and convex hulls made easy
- First Online:
- Cite this article as:
- Seidel, R. Discrete Comput Geom (1991) 6: 423. doi:10.1007/BF02574699
- 249 Views
We present two randomized algorithms. One solves linear programs involvingm constraints ind variables in expected timeO(m). The other constructs convex hulls ofn points in ℝd,d>3, in expected timeO(n[d/2]). In both boundsd is considered to be a constant. In the linear programming algorithm the dependence of the time bound ond is of the formd!. The main virtue of our results lies in the utter simplicity of the algorithms as well as their analyses.