This paper proposes a simple facet enumeration algorithm for convex polytopes. The complexity of the algorithm is analyzed. The algorithm is implemented in Matlab. Some polytopes with known H-representations and V-representations are used as test examples. The preliminary numerical test shows the effectiveness and efficiency of the proposed algorithm. Due to the duality between the vertex enumeration problem and facet enumeration problem, we expect that this method can also be used to solve the vertex enumeration problem.
Citation
Journal of Convex Analysis