A Facet Enumeration Algorithm for Convex Polytopes
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2019
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913660142616576 |
|---|---|
| author | Yang, Yaguang |
| author_facet | Yang, Yaguang |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1909_11843 |
| institution | arXiv |
| publishDate | 2019 |
| record_format | arxiv |
| spellingShingle | A Facet Enumeration Algorithm for Convex Polytopes Yang, Yaguang Optimization and Control Combinatorics 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. |
| title | A Facet Enumeration Algorithm for Convex Polytopes |
| topic | Optimization and Control Combinatorics |
| url | https://arxiv.org/abs/1909.11843 |