W. F. Lunnon. Multi-dimensional map-folding. The Computer Journal, 14(1):75-80, February 1971. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
When Can You Fold a Map? - Arkin, Bender, Demaine, Demaine.. (Correct)
....first suite of results that may be helpful towards a fuller algorithmic understanding of the several manufacturing problems that arise, e.g. in making threedimensional cardboard and sheet metal structures. Related Work. Our problem is related to the classic combinatorics question of map folding [15]. This question asks for the number of foldings of a particular crease pattern, namely an m n rectangular grid, by a sequence of simple folds. See also the discussion in Gardner s book [6] In contrast with this combinatorics question, we study the algorithmic complexity of the decision problem, ....
W. F. Lunnon. Multi-dimensional map-folding. The Computer Journal, 14(1):75--80, 1971.
Recognizing Simply Foldable Origami - Arkin, Bender, Demaine, Demaine.. (Correct)
....a crease pattern is shown to be NP hard. Demaine et al. 4] have used computational geometry techniques to show that any polygonal (connected) silhouette can be obtained by simple folds from a rectangular piece of paper. Our problem is related to the classic combinatorics question of map folding [14]. This question asks for the number of foldings of a particular crease pattern, namely an m Theta n rectangular grid, by a sequence of simple folds. See also the discussion in Gardner s book [6] In contrast with this combinatorics question, we study the algorithmic complexity of the decision ....
W.F. Lunnon. Multi-dimensional map-folding. The Computer Journal, 14(1):75--80, February 1971.
When Can You Fold a Map? - Arkin, Bender, Demaine, Demaine.. (2000) (Correct)
....develop a first suite of results that may be helpful towards a fuller understanding of the several manufacturing problems that arise, e.g. in making three dimensional cardboard and sheet metal structures. Related Work. Our problem is related to the classic combinatorics question of map folding [14]. This question asks for the number of foldings of a particular crease pattern, namely an m n rectangular grid, by a sequence of simple folds. See also the discussion in Gardner s book [6] In contrast with this combinatorics question, we study the algorithmic complexity of the decision problem, ....
W.F. Lunnon. Multi-dimensional map-folding. The Computer Journal, 14(1):75--80, February 1971.
When Can You Fold a Map? - Arkin, Bender, Demaine, Demaine.. (Correct)
....to develop a first suite of results that may be helpful towards a fuller understanding of the several manufacturing problems that arise, e.g. in making three dimensional cardboard and sheet metal structures. Related Work. Our problem is related to the classic combinatorics question of map folding [3, 5]. This question asks for the number of foldings of a particular crease pattern, namely an m n rectangular grid, by a sequence of simple folds. In contrast with this combinatorics question, we study the algorithmic complexity of the decision problem, also in some more general instances of crease ....
W.F. Lunnon. Multi-dimensional map-folding. The Computer Journal, 14(1):75--80, February 1971.
When Can You Fold a Map? - Arkin, Bender, Demaine, Demaine.. (Correct)
No context found.
W. F. Lunnon. Multi-dimensional map-folding. The Computer Journal, 14(1):75-80, February 1971.
Recent Results in Computational Origami - Demaine, Demaine (2001) (2 citations) (Correct)
No context found.
W. F. Lunnon. Multi-dimensional map-folding. The Computer Journal, 14(1):75-80, February 1971.
When Can You Fold a Map? - Arkin, Bender, Demaine, Demaine.. (Correct)
No context found.
W. F. Lunnon. Multi-dimensional map-folding. The Computer Journal, 14(1):75--80, February 1971.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC