Dynamic three-dimensional linear programming

Linear programming optimizations on the intersection of k polyhedra in R³, represented by their outer recursive decompositions, are performed in expected time O(k log k log n+√k log k log³ n). This result is used to derive efficient algorithms for dynamic linear programming problems ill which constraints are inserted and deleted, and queries must optimize specified objective functions. As an application, an improved solution to the planar 2-center problem, is described