Ununfoldable polyhedra with convex faces
DOI10.1016/S0925-7721(02)00091-3zbMATH Open1021.52013OpenAlexW2148125855WikidataQ56970670 ScholiaQ56970670MaRDI QIDQ1869740FDOQ1869740
Publication date: 28 April 2003
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0925-7721(02)00091-3
Recommendations
treenetsdiscrete geometryedge unfoldingvertex unfoldingedge cuttingconvex closed polyhedronconvex unfoldingcuts across facesgeneral unfoldinggluing hats togethermiddle verticesopen convex-faced polyhedronpolyhedron with negative curvaturespike trianglespiked tetrahedrontopologically convex polyhedraunfolding polyhedra
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Unsolved problems in geometry
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Discrete Geodesic Problem
- On Shortest Paths in Polyhedral Spaces
- Title not available (Why is that?)
- Convex polytopes with convex nets
- Star Unfolding of a Polytope with Applications
- On the development of closed convex curves on 3-polytopes
- Nonoverlap of the star unfolding
- Title not available (Why is that?)
- Title not available (Why is that?)
- Enumerating foldings and unfoldings between polygons and polytopes
Cited In (22)
- Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings
- An algorithmic study of manufacturing paperclips and other folded structures.
- When can a net fold to a polyhedron?
- Ununfoldable polyhedra with \(6\) vertices or \(6\) faces
- A starshaped polyhedron with no net
- On the development of the intersection of a plane with a polytope
- Pseudo-edge unfoldings of convex polyhedra
- The material reasoning of folding paper
- Unfolding Level 1 Menger Polycubes of Arbitrary Size With Help of Outer Faces
- On polyhedral realization with isosceles triangles
- Title not available (Why is that?)
- Continuous blooming of convex polyhedra
- Unfoldings and nets of regular polytopes
- Unfolding polycube trees with constant refinement
- A convex polyhedron which is not equifacettable
- Unfolding genus-2 orthogonal polyhedra with linear refinement
- Enumerating foldings and unfoldings between polygons and polytopes
- Title not available (Why is that?)
- Toward unfolding doubly covered \(n\)-stars
- Unfolding orthogonal polyhedra with quadratic refinement: the delta-unfolding algorithm
- Unfolding H-convex Manhattan towers
- Unfolding \(3\)-separated polycube graphs of arbitrary genus
Uses Software
This page was built for publication: Ununfoldable polyhedra with convex faces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869740)
