Fast detection of polyhedral intersection. David P. Dobkin and David G. Kirkpatrick. A linear algorithm for determining the separation of convex polyhedra. M. E. Dyer. David G. Kirkpatrick and Raimund Seidel.
Linear optimization queries.
Applying parallel computation algorithms in the design of serial algorithms. Linear programming in linear time when the dimension is fixed. On the detection of a common intersection of k convex objects in the plane. Micha Sharir and Emo Welzl. A combinatorial bound for linear programming and related problems.