2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1991)
San Juan, Puerto Rico
Oct. 1, 1991 to Oct. 4, 1991
D. Eppstein , Dept. of Inf.&Comput. Sci., California Univ., Irvine, CA, USA
Linear programming optimizations on the intersection of k polyhedra in R/sup 3/, represented by their outer recursive decompositions, are performed in expected time O(k log k log n+ square root k log k log/sup 3/ 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.
planar 2-center problem, dynamic 3D linear programming, dynamic three dimensional programming, outer recursive decompositions, expected time, objective functions
D. Eppstein, "Dynamic three-dimensional linear programming", 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, vol. 00, no. , pp. 488-494, 1991, doi:10.1109/SFCS.1991.185410