A Facet Enumeration Algorithm for Convex Polytopes
Optimization and Control
2025-01-23 v3 Combinatorics
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.
Cite
@article{arxiv.1909.11843,
title = {A Facet Enumeration Algorithm for Convex Polytopes},
author = {Yaguang Yang},
journal= {arXiv preprint arXiv:1909.11843},
year = {2025}
}
Comments
16 pages, 2 figures, 16 references