MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Dynamic Three-Dimensional Linear Programming (1992) [33 citations — 4 self]

by David Eppstein
Add To MetaCart

Abstract:

We perform linear programming optimizations on the intersection of k polyhedra in R³, represented by their outer recursive decompositions, in expected time O(k log k log n + √k log k log³ n). We use this result to derive efficient algorithms for dynamic linear programming problems in which constraints are inserted and deleted, and queries must optimize specified objective functions. As an application, we describe an improved solution to the planar 2-center and 2-median problems.

Citations

204 Optimal search in planar subdivisions – Kirkpatrick - 1983
174 Linear programming and convex hulls made easy – Seidel - 1990
160 Linear-Time Algorithms for Linear Programming in R3 and Related Problems – Megiddo - 1983
151 Linear programming in linear time when the dimension is – Megiddo - 1984
128 Leeuwen, Maintenance of configurations in the plane – Overmars, van - 1981
83 Decomposable searching problems I: static-to-dynamic transformation – Bentley, Saxe - 1980
69 Fast detection of polyhedral intersection – DOBKIN, KIRKPATRICK - 1983
52 An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra – Chazelle - 1992
25 O#-line maintenance of planar configurations – Hershberger, Suri - 1996
12 Linear algorithms for two and three-variable linear programs – Dyer - 1984
11 Finding extreme points in three dimensions and solving the post-office problem in the plane. Inf Process – EDELSBRUNNER, MAURER - 1985
8 Planar geometric location problems and maintaining the width of a planar set – Agarwal, Sharir - 1991
6 Leeuwen. Dynamization of decomposable searching problems yielding good worst case bounds – Overmars, van - 1981
5 The planar two-center and two-median problems, Transportation Science 18 – Drezner - 1984
4 private communication – Dobkin - 1991
4 Dynamically computing the maxima of decomposable functions, with applications – Dobkin, Suri - 1989
3 offline algorithms, and space compaction – Persistence - 1991