arXiv · 1709.04944
Pseudo-edge unfoldings of convex polyhedra
Abstract
A pseudo-edge graph of a convex polyhedron K is a 3-connected embedded graph in K whose vertices coincide with those of K, whose edges are distance minimizing geodesics, and whose faces are convex. We construct a convex polyhedron K in Euclidean 3-space with a pseudo-edge graph with respect to which K is not unfoldable. The proof is based on a result of Pogorelov on convex caps with prescribed curvature, and an unfoldability obstruction for almost flat convex caps due to Tarasov. Our example, which has 340 vertices, significantly simplifies an earlier construction by Tarasov, and confirms that Durer's conjecture does not hold for pseudo-edge unfoldings.
Explore related subjects
Keep this discovery
Nicholas Barvinok, Mohammad Ghomi. 2017-09-14. Pseudo-edge unfoldings of convex polyhedra. https://arxiv.org/abs/1709.04944
Cite the original work for its findings. Save a collection to share your selection of sources.