  An efficient algorithm to enumerate the vertices of a two-dimensional (2D)
projection of a polytope, is presented in this paper. The proposed algorithm
uses the support function of the polytope to be projected and enumerated for
vertices. The complexity of our algorithm is linear in the number of vertices
of the projected polytope and we show empirically that the performance is
significantly better in comparison to some known efficient algorithms of
projection and enumeration.
