Equality Set Projection: A new algorithm for the projection of polytopes in halfspace representation
Jones C. N. and Kerrigan E. C. and Maciejowski J. M.
March 2004
Technical Report: CUED/F-INFENG/TR.463
Abstract
In this paper we introduce a new algorithm called Equality Set Projection ESP for computing the orthogonal projection of bounded, convex polytopes. Our solution addresses the case where the input polytope is represented as the intersection of a finite number of halfplanes and its projection is given in an irredundant halfspace form. Unlike many existing approaches, the key advantage offered by ESP is its output sensitivity, i.e., its complexity is a function of the number of facets in the projection of the polytope. This feature makes it particularly suited for many problems of theoretical and practical importance in which the number of vertices far exceeds the number of facets. Further, it is shown that for non-degenerate polytopes of fixed size (dimension and number of facets) the complexity is linear in the number of facets in the projection. Numerical results are presented that demonstrate that high dimensional polytopes can be projected efficiently.
Pre-Prints
[PS|PDF]
BibTex Entry
- @TechReport{jones:kerrigan:maciejowski:2004,
- author = {Jones C. N. and Kerrigan E. C. and Maciejowski J. M.},
- institution = {Department of Engineering, University of Cambridge},
- title = {Equality Set Projection: A new algorithm for the projection of polytopes in halfspace representation},
- year = {2004},
- bibkey = {jones:kerrigan:maciejowski:2004},
- month = {March},
- note = {CUED/F-INFENG/TR.463}
- }
|
![[Dept of Engineering]](http://www.eng.cam.ac.uk/images/house_style/engban-s.gif)
