SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Tentative prune-and-search for computing Voronoi vertices
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Faster construction of planar two-centers
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Average case analysis of dynamic geometric optimization
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The 2-center problem with obstacles
Proceedings of the sixteenth annual symposium on Computational geometry
Optimizing the sum of linear fractional functions and applications
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The 2-center problem with obstacles
Journal of Algorithms
| Hi-index | 0.00 |
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.