Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

FOCS
1991
IEEE

favoriteEmaildiscussreport

116views Theoretical Computer Science» more FOCS 1991»

Dynamic Three-Dimensional Linear Programming

13 years 8 months ago

Dynamic Three-Dimensional Linear Programming

Download www.ics.uci.edu

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

David Eppstein

Real-time Traffic

FOCS 1991 | Linear Programming | Linear Programming Optimizations | Outer Recursive Decompositions | Theoretical Computer Science |

claim paper

Related Content

» A Tool for Visualizing the Topology of ThreeDimensional Vector Fields

» A reduced threedimensional dynamic structural model for structural health assessment

» Dynamic Component Program Visualization

» A Realtime Pattern Generator for Biped Walking

» Simpler and Faster HLBVH with Work Queues

» Soft body locomotion

» Perception of linear and nonlinear motion properties using a FACS validated 3D facial mode...

» Synthesis of complex dynamic character motion from simple animations

» Interactive skeletondriven dynamic deformations

Post Info
More Details (n/a)

Added	27 Aug 2010
Updated	27 Aug 2010
Type	Conference
Year	1991
Where	FOCS
Authors	David Eppstein

Comments (0)