Back to search

Georgia Institute of Technology

Unfoldings of Convex Polyhedra

Abstract

dc:description.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 criterion 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 problem is false for pseudo-edge unfoldings. We then use the Maxwell-Cremona Correspondence to present evidence both for and against Durer's problem.

Degree

thesis:*
Level thesis:degree_level
Doctoral
Department dc:contributor.department
Mathematics
Grantor dc:publisher
Georgia Institute of Technology
Year dc:date.issued
2023

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Barvinok, Nicholas
Advisor dc:contributor.advisor
  • Ghomi, Mohammad
Committee members dc:contributor.committeemember
  • Livshyts, Galyna V.
  • Belegradek, Igor
  • Burago, Dmitri
  • O’Rourke, Joseph

Subjects

dc:subject × 5

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/1853/72747

Chain of custody

source
Harvested from
Georgia Tech
Base URL
repository.gatech.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Barvinok, Nicholas. Unfoldings of Convex Polyhedra. Doctoral thesis, Georgia Institute of Technology, 2023. https://hdl.handle.net/1853/72747