When can a net fold to a polyhedron?

DOI10.1016/J.COMGEO.2004.12.004MaRDI QIDQ2486084zbMATH OpenOpenAlexFDO

Authors Anna Lubiw, Julie Sun, Therese 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

zbMATH Keywords

Computational geometryFoldingNetPolyhedron

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 1629824
• When can you fold a map?
• scientific article; zbMATH DE number 1830752
• Flat foldings of plane graphs with prescribed angles and edge lengths
• Folding Polyominoes into (Poly)Cubes

Cites work

• Convex polytopes with convex nets
• Geometric algorithms and combinatorial optimization
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1026567 (Why is no real title available?)
• scientific article; zbMATH DE number 3193312 (Why is no real title available?)
• Locked and unlocked polygonal chains in three dimensions
• Nonoverlap of the star unfolding
• NONTRIVIAL EMBEDDINGS OF POLYGONAL INTERVALS AND UNKNOTS IN 3-SPACE
• Reconfiguring closed polygonal chains in Euclidean \(d\)-space
• The complexity of (un)folding
• Ununfoldable polyhedra with convex faces
• Vertex-unfoldings of simplicial manifolds
• When can you fold a map?

Cited in

(12)

• Bumpy pyramid folding
• Folding cartons: interactive manipulation of cartons from 2D layouts
• When can you fold a map?
• Stoker's theorem for orthogonal polyhedra
• Box pleating is hard
• scientific article; zbMATH DE number 1830752 (Why is no real title available?)
• ON UNFOLDING LATTICE POLYGONS/TREES AND DIAMETER-4 TREES
• scientific article; zbMATH DE number 7650934 (Why is no real title available?)
• Locked and unlocked smooth embeddings of surfaces
• Minimum cost open chain reconfiguration
• Continuous blooming of convex polyhedra
• Folding polyominoes with holes into a cube

This page was built for publication: When can a net fold to a polyhedron?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2486084)