A tight bound for the number of different directions in three dimensions
Proceedings of the nineteenth annual symposium on Computational geometry
Graph drawings with few slopes
Computational Geometry: Theory and Applications
Hi-index | 0.00 |
We show that the minimum number of distinct edge-directions of a convex polytope with n vertices in Rd is 0(dn1/(d-1)).