A note on the minimum number of edge-directions of a convex polytope
| Autor: | Rom Pinchasi, Shmuel Onn |
|---|---|
| Rok vydání: | 2004 |
| Předmět: |
Convex hull
medicine.medical_specialty Convex polytope Combinatorial optimization Birkhoff polytope Polyhedral combinatorics Polytope Uniform k 21 polytope Edge direction Theoretical Computer Science Combinatorics Computational Theory and Mathematics Happy ending problem Edge Cross-polytope medicine Discrete Mathematics and Combinatorics Zonotope Vertex enumeration problem Mathematics |
| Zdroj: | Journal of Combinatorial Theory, Series A. 107:147-151 |
| ISSN: | 0097-3165 |
| DOI: | 10.1016/j.jcta.2004.03.008 |
| Popis: | We show that the minimum number of distinct edge-directions of a convex polytope with n vertices in Rd is θ(dn1/(d−1)). |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect