When can a net fold to a polyhedron?
From MaRDI portal
Publication:2486084
DOI10.1016/j.comgeo.2004.12.004zbMath1115.52008OpenAlexW2096616111MaRDI QIDQ2486084
Anna Lubiw, Julie Sun, Therese C. Biedl
Publication date: 5 August 2005
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.12.004
Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
STOKER'S THEOREM FOR ORTHOGONAL POLYHEDRA ⋮ Folding cartons: interactive manipulation of cartons from 2D layouts ⋮ ON UNFOLDING LATTICE POLYGONS/TREES AND DIAMETER-4 TREES ⋮ Minimum cost open chain reconfiguration ⋮ Unnamed Item ⋮ Continuous blooming of convex polyhedra
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonoverlap of the star unfolding
- Geometric algorithms and combinatorial optimization
- Reconfiguring closed polygonal chains in Euclidean \(d\)-space
- Ununfoldable polyhedra with convex faces
- When can you fold a map?
- Convex polytopes with convex nets
- NONTRIVIAL EMBEDDINGS OF POLYGONAL INTERVALS AND UNKNOTS IN 3-SPACE
- Vertex-unfoldings of simplicial manifolds
- The complexity of (un)folding
- Locked and unlocked polygonal chains in three dimensions
