Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven S. Skiena  Home/Search
Context
Related
| sunysb.edu/~skiena/pap...simplefolds.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: sunysb.edu/~skiena/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We explore the following problem: given a collection of creases on a piece of paper, each assigned a folding direction of mountain or valley, is there a flat folding by a sequence of simple folds? There are several models of simple folds; the simplest one-layer simple fold rotates a portion of paper about a crease in the paper by \Sigma180 . We first consider the analogous questions in one dimension lower---bending a segment into a flat object---which lead to interesting problems on strings. ... (Update)
Similar documents (at the sentence level):
79.7%: When Can You Fold a Map? - Arkin, Bender, Demaine, Demaine.. (2000) (Correct)
Active bibliography (related documents): More All
0.6: Recent Results in Computational Origami - Demaine, Demaine (2001) (Correct)
0.4: Folding and Cutting Paper - Demaine, Demaine, Lubiw (1998) (Correct)
0.3: A Motion Planning Approach to Folding: From Paper Craft to.. - Song, Amato (2000) (Correct)
Similar documents based on text: More All
1.2: The Complexity of Flat Origami (Extended Abstract) - Bern, Hayes (1996) (Correct)
0.9: Reaching Folded States of a Rectangular Piece of Paper - Demaine, Mitchell (2001) (Correct)
0.9: On the Mathematics of Flat Origamis - Hull (1994) (Correct)
BibTeX entry: (Update)
@misc{ arkin-recognizing,
author = "Esther M. Arkin and Michael A. Bender and Erik D. Demaine and Martin L.
Demaine and Joseph S. B. Mitchell and Saurabh Sethia and Steven S. Skiena",
title = "Recognizing Simply Foldable Origami",
url = "citeseer.ist.psu.edu/553014.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
837 Cambridge University Press (context) - Motwani, Raghavan et al. - 1995
136 Fast algorithms for finding nearest common ancestors (context) - Harel, Tarjan - 1984
95 On finding lowest common ancestors: Simplification and paral.. (context) - Schieber, Vishkin - 1988
89 Efficient randomized patternmatching algorithms (context) - Karp, Rabin - 1987
38 the complexity of protein folding - Crescenzi, Goldman et al. - 1998
23 A computational algorithm for origami design (context) - Lang - 1996
20 Optimal suffix tree construction with large alphabets - Farach - 1997
17 Faster deterministic sorting and priority queues in linear s.. (context) - Thorup - 1998
13 The complexity of flat origami - Bern, Hayes - 1996
11 the relation between mountain-creases and valley-creases of .. (context) - Kawasaki - 1989
8 the mathematics of flat origamis - Hull - 1994
8 Folding flat silhouettes and wrapping polyhedral packages: N.. - Demaine, Demaine et al. - 2000
8 the manufacturability of paper-clips and sheet metal structu.. - Arkin, Fekete et al. - 1999
7 Multi-dimensional map-folding (context) - Lunnon - 1971
7 Towards a mathematical theory of origami (context) - Justin - 1994
6 The combinatorics of paper folding (context) - Gardner - 1983
5 British Origami Society (context) - Smith - 1980
4 Origami profiles (context) - Smith - 1976
Documents on the same site (http://www.cs.sunysb.edu/~skiena/papers/): More
Optimizing RNA Secondary Structure Over All Possible Encodings .. - Cohen, Skiena (2000) (Correct)
Exploiting Genetic Code Redundancy to Optimize RNA Secondary.. - Cohen, Skiena (2000) (Correct)
Combinatorial Dominance Guarantees for Heuristic Algorithms.. - Berend, Skiena (Correct)
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