No CrossRef data available.
Article contents
Convex polygons as carriers
Published online by Cambridge University Press: 14 March 2016
Extract
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.
We shall use the word ‘polyhedron’ to mean a connected, simply-connected 3-polytope of positive (non-zero) volume. The idea of the net of a polyhedron P is well known. For example, the regular octahedron has eleven distinct nets, three of which are shown in Figure 1. A net consists of three parts:
(a) A plane connected and simply-connected polygon Q (denoted by heavy lines in the diagrams), known as the carrier of the net;
(b) A set of lines known as, fold-lines in the interior of Q;
(c) A labelling of the edges of Q.
If one cuts Q out of paper or similar material, folds it along the fold-lines, and then pastes together edges with matching labels, one obtains a model of the polyhedron P. We say that a net is convex if, and only if, its carrier Q is convex.
Information
- Type
- Research Article
- Information
- Copyright
- Copyright © Mathematical Association 2016
References
1.O'Rourke, Joseph, Dürer's Problem, in Senechal, Marjorie (ed.), Shaping space, exploring polyhedra in nature, art, and geometrical Imagination, Springer (2013) pp. 77–86.CrossRefGoogle Scholar
2.Shephard, G. C., Convex polytopes with convex nets, Math. Proc. Camb. Phil. Soc. 78 (1975) pp. 389–403.Google Scholar
3.Demaine, Eric D. and O'Rourke, Joseph, Geometric folding algorithms: linkages, origami, polyhedra, Cambridge University Press (2007).CrossRefGoogle Scholar
4.Burago, Yu D. and Zalgaller, V. A., Isometric piecewise-linear embeddings of two-dimensional manifolds with a polyhedral metric into R3, (English version), St Petersburg Mathematical Journal 7(3) (1996) pp. 369–385.Google Scholar
You have Access