On the maximal number of edges of convex digital polygons included into an m × m-grid
Journal of Combinatorial Theory Series A
On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
Computational Geometry: Theory and Applications
Steinitz representations of polyhedra and the Colin de Verdiére number
Journal of Combinatorial Theory Series B
On the number of spanning trees a planar graph can have
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Small Grid Embeddings of 3-Polytopes
Discrete & Computational Geometry
Embedding stacked polytopes on a polynomial-size grid
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
This is a survey on methods to construct a three-dimensional convex polytope with a given combinatorial structure, that is, with the edges forming a given 3-connected planar graph, focusing on efforts to achieve small integer coordinates.