Dynamic Three-Dimensional Linear Programming

We perform linear programming optimizations on the intersection of k polyhedra in R 3 , represented by their outer recursive decompositions, in expected time O(k log k log n + √k log k log 3 n). We use this result to derive efficient algorithms for dynamic linear programming problems in which constr... View More