2019
DOI: 10.1007/s00454-019-00082-1
|View full text |Cite
|
Sign up to set email alerts
|

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 ver… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 18 publications
0
3
0
Order By: Relevance
“…-Let T the number of triangles and E the number of edges in some geodesic triangulation of (S, m). We have E = 3 2 T , so that the Euler formula…”
Section: Flat Metricsmentioning
confidence: 99%
See 1 more Smart Citation
“…-Let T the number of triangles and E the number of edges in some geodesic triangulation of (S, m). We have E = 3 2 T , so that the Euler formula…”
Section: Flat Metricsmentioning
confidence: 99%
“…This construction is similar to unfolding a convex polytope. On the problem of a non-self-intersecting unfolding see [3].…”
Section: Positive Curvaturesmentioning
confidence: 99%
“…• There exists a convex polyhedron, equipped with 3-vertex-connected planar graph of geodesics partitioning the surface into regions metrically equivalent to convex polygons, that cannot be cut and unfolded along graph edges [6].…”
Section: Introductionmentioning
confidence: 99%