A note on the minimum number of edge-directions of a convex polytope

DOI10.1016/j.jcta.2004.03.008zbMath1060.52006OpenAlexW2017671129MaRDI QIDQ598444

Shmuel Onn, Rom Pinchasi

Publication date: 6 August 2004

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2004.03.008

zbMATH Keywords

combinatorial optimizationmoment curvecubical zonotopeoriented edge direction

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27) Asymptotic enumeration (05A16)

Related Items (2)

Graph drawings with few slopes ⋮ On the Length of Monotone Paths in Polyhedra

Cites Work

• 2N noncollinear points determine at least 2N directions
• Momentopes, the complexity of vector partitioning, and Davenport-Schinzel sequences
• Convex combinatorial optimization
• A tight bound for the number of different directions in three dimensions

This page was built for publication: A note on the minimum number of edge-directions of a convex polytope