A Facet Enumeration Algorithm for Convex Polytopes
From MaRDI portal
Publication:6326005
arXiv1909.11843MaRDI QIDQ6326005FDOQ6326005
Authors: Ya-Guang Yang 
Publication date: 25 September 2019
Abstract: This paper proposes a novel and simple algorithm of facet enumeration for convex polytopes. The complexity of the algorithm is discussed. The algorithm is implemented in Matlab. Some simple polytopes with known H-representations and V-representations are used as the test examples. 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.
This page was built for publication: A Facet Enumeration Algorithm for Convex Polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6326005)
