1 problem

Polynomial grid-size conjecture. Every plane triangulation can be realized as the graph of a convex polyhedron embedded in an integer grid whose side lengths are bounded by a polyn…