Folding and Punching Paper
We show how to fold a piece of paper and punch one hole so as to produce any desired pattern of holes. Given n points on a piece of paper (finite polygon or infinite plane), we give algorithms to fold the paper flat so that those n points and no other points of paper map to a common location, so tha...
Gespeichert in:
| Veröffentlicht in: | Journal of Information Processing 2017, Vol.25, pp.590-600 |
|---|---|
| Hauptverfasser: | , , , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 600 |
|---|---|
| container_issue | |
| container_start_page | 590 |
| container_title | Journal of Information Processing |
| container_volume | 25 |
| creator | Asao, Yasuhiko Demaine, Erik D. Demaine, Martin L. Hosaka, Hideaki Kawamura, Akitoshi Tachi, Tomohiro Takahashi, Kazune |
| description | We show how to fold a piece of paper and punch one hole so as to produce any desired pattern of holes. Given n points on a piece of paper (finite polygon or infinite plane), we give algorithms to fold the paper flat so that those n points and no other points of paper map to a common location, so that punching one hole and unfolding produces exactly the desired pattern of holes. Furthermore, we can forbid creases from passing through the points (allowing noncircular hole punches). Our solutions use relatively few creases (in some cases, polynomially many), and can be expressed as a linear sequence of folding steps of complexity O(1)—a generalization of simple folds which we introduce. |
| doi_str_mv | 10.2197/ipsjjip.25.590 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2014581045</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2014581045</sourcerecordid><originalsourceid>FETCH-LOGICAL-c4020-a3a980b93a4623cbfa45acb8414d937451eee3601ac0bb1fe6d1eba615c8861a3</originalsourceid><addsrcrecordid>eNpNj01Lw0AQhhdRsFavHjwVPCfO7Fc3x1KsCgV70PMy2WzahJjE3fbgvzclpfQ0M8zzzvAw9oiQcszmL1Uf67rqU65SlcEVm6AxPNFa8euL_pbdxVgD6AwUTNjTqmuKqt3OqC1mm0PrdsdhQ70P9-ympCb6h1Odsu_V69fyPVl_vn0sF-vESeCQkKDMQJ4JkpoLl5ckFbncSJRFJuZSofdeaEBykOdYel2gz0mjcsZoJDFlz-PdPnS_Bx_3tu4OoR1eWg4olUGQaqDSkXKhizH40vah-qHwZxHs0d-e_C1XdvAfAosxUMc9bf0Zp7CvXOMvcThlzju3o2B9K_4Bf75lpw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2014581045</pqid></control><display><type>article</type><title>Folding and Punching Paper</title><source>J-STAGE Free</source><creator>Asao, Yasuhiko ; Demaine, Erik D. ; Demaine, Martin L. ; Hosaka, Hideaki ; Kawamura, Akitoshi ; Tachi, Tomohiro ; Takahashi, Kazune</creator><creatorcontrib>Asao, Yasuhiko ; Demaine, Erik D. ; Demaine, Martin L. ; Hosaka, Hideaki ; Kawamura, Akitoshi ; Tachi, Tomohiro ; Takahashi, Kazune</creatorcontrib><description>We show how to fold a piece of paper and punch one hole so as to produce any desired pattern of holes. Given n points on a piece of paper (finite polygon or infinite plane), we give algorithms to fold the paper flat so that those n points and no other points of paper map to a common location, so that punching one hole and unfolding produces exactly the desired pattern of holes. Furthermore, we can forbid creases from passing through the points (allowing noncircular hole punches). Our solutions use relatively few creases (in some cases, polynomially many), and can be expressed as a linear sequence of folding steps of complexity O(1)—a generalization of simple folds which we introduce.</description><identifier>ISSN: 1882-6652</identifier><identifier>EISSN: 1882-6652</identifier><identifier>DOI: 10.2197/ipsjjip.25.590</identifier><language>eng</language><publisher>Tokyo: Information Processing Society of Japan</publisher><subject>flat folding ; fold-and-cut problem ; fold-and-punch problem ; Folding ; folding complexity ; origami ; Punches</subject><ispartof>Journal of Information Processing, 2017, Vol.25, pp.590-600</ispartof><rights>2017 by the Information Processing Society of Japan</rights><rights>Copyright Japan Science and Technology Agency 2017</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c4020-a3a980b93a4623cbfa45acb8414d937451eee3601ac0bb1fe6d1eba615c8861a3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,1877,27901,27902</link.rule.ids></links><search><creatorcontrib>Asao, Yasuhiko</creatorcontrib><creatorcontrib>Demaine, Erik D.</creatorcontrib><creatorcontrib>Demaine, Martin L.</creatorcontrib><creatorcontrib>Hosaka, Hideaki</creatorcontrib><creatorcontrib>Kawamura, Akitoshi</creatorcontrib><creatorcontrib>Tachi, Tomohiro</creatorcontrib><creatorcontrib>Takahashi, Kazune</creatorcontrib><title>Folding and Punching Paper</title><title>Journal of Information Processing</title><addtitle>Journal of Information Processing</addtitle><description>We show how to fold a piece of paper and punch one hole so as to produce any desired pattern of holes. Given n points on a piece of paper (finite polygon or infinite plane), we give algorithms to fold the paper flat so that those n points and no other points of paper map to a common location, so that punching one hole and unfolding produces exactly the desired pattern of holes. Furthermore, we can forbid creases from passing through the points (allowing noncircular hole punches). Our solutions use relatively few creases (in some cases, polynomially many), and can be expressed as a linear sequence of folding steps of complexity O(1)—a generalization of simple folds which we introduce.</description><subject>flat folding</subject><subject>fold-and-cut problem</subject><subject>fold-and-punch problem</subject><subject>Folding</subject><subject>folding complexity</subject><subject>origami</subject><subject>Punches</subject><issn>1882-6652</issn><issn>1882-6652</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><recordid>eNpNj01Lw0AQhhdRsFavHjwVPCfO7Fc3x1KsCgV70PMy2WzahJjE3fbgvzclpfQ0M8zzzvAw9oiQcszmL1Uf67rqU65SlcEVm6AxPNFa8euL_pbdxVgD6AwUTNjTqmuKqt3OqC1mm0PrdsdhQ70P9-ympCb6h1Odsu_V69fyPVl_vn0sF-vESeCQkKDMQJ4JkpoLl5ckFbncSJRFJuZSofdeaEBykOdYel2gz0mjcsZoJDFlz-PdPnS_Bx_3tu4OoR1eWg4olUGQaqDSkXKhizH40vah-qHwZxHs0d-e_C1XdvAfAosxUMc9bf0Zp7CvXOMvcThlzju3o2B9K_4Bf75lpw</recordid><startdate>20170101</startdate><enddate>20170101</enddate><creator>Asao, Yasuhiko</creator><creator>Demaine, Erik D.</creator><creator>Demaine, Martin L.</creator><creator>Hosaka, Hideaki</creator><creator>Kawamura, Akitoshi</creator><creator>Tachi, Tomohiro</creator><creator>Takahashi, Kazune</creator><general>Information Processing Society of Japan</general><general>Japan Science and Technology Agency</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20170101</creationdate><title>Folding and Punching Paper</title><author>Asao, Yasuhiko ; Demaine, Erik D. ; Demaine, Martin L. ; Hosaka, Hideaki ; Kawamura, Akitoshi ; Tachi, Tomohiro ; Takahashi, Kazune</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c4020-a3a980b93a4623cbfa45acb8414d937451eee3601ac0bb1fe6d1eba615c8861a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>flat folding</topic><topic>fold-and-cut problem</topic><topic>fold-and-punch problem</topic><topic>Folding</topic><topic>folding complexity</topic><topic>origami</topic><topic>Punches</topic><toplevel>online_resources</toplevel><creatorcontrib>Asao, Yasuhiko</creatorcontrib><creatorcontrib>Demaine, Erik D.</creatorcontrib><creatorcontrib>Demaine, Martin L.</creatorcontrib><creatorcontrib>Hosaka, Hideaki</creatorcontrib><creatorcontrib>Kawamura, Akitoshi</creatorcontrib><creatorcontrib>Tachi, Tomohiro</creatorcontrib><creatorcontrib>Takahashi, Kazune</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Journal of Information Processing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Asao, Yasuhiko</au><au>Demaine, Erik D.</au><au>Demaine, Martin L.</au><au>Hosaka, Hideaki</au><au>Kawamura, Akitoshi</au><au>Tachi, Tomohiro</au><au>Takahashi, Kazune</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Folding and Punching Paper</atitle><jtitle>Journal of Information Processing</jtitle><addtitle>Journal of Information Processing</addtitle><date>2017-01-01</date><risdate>2017</risdate><volume>25</volume><spage>590</spage><epage>600</epage><pages>590-600</pages><issn>1882-6652</issn><eissn>1882-6652</eissn><abstract>We show how to fold a piece of paper and punch one hole so as to produce any desired pattern of holes. Given n points on a piece of paper (finite polygon or infinite plane), we give algorithms to fold the paper flat so that those n points and no other points of paper map to a common location, so that punching one hole and unfolding produces exactly the desired pattern of holes. Furthermore, we can forbid creases from passing through the points (allowing noncircular hole punches). Our solutions use relatively few creases (in some cases, polynomially many), and can be expressed as a linear sequence of folding steps of complexity O(1)—a generalization of simple folds which we introduce.</abstract><cop>Tokyo</cop><pub>Information Processing Society of Japan</pub><doi>10.2197/ipsjjip.25.590</doi><tpages>11</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1882-6652 |
| ispartof | Journal of Information Processing, 2017, Vol.25, pp.590-600 |
| issn | 1882-6652 1882-6652 |
| language | eng |
| recordid | cdi_proquest_journals_2014581045 |
| source | J-STAGE Free |
| subjects | flat folding fold-and-cut problem fold-and-punch problem Folding folding complexity origami Punches |
| title | Folding and Punching Paper |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-12T10%3A47%3A23IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Folding%20and%20Punching%20Paper&rft.jtitle=Journal%20of%20Information%20Processing&rft.au=Asao,%20Yasuhiko&rft.date=2017-01-01&rft.volume=25&rft.spage=590&rft.epage=600&rft.pages=590-600&rft.issn=1882-6652&rft.eissn=1882-6652&rft_id=info:doi/10.2197/ipsjjip.25.590&rft_dat=%3Cproquest_cross%3E2014581045%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2014581045&rft_id=info:pmid/&rfr_iscdi=true |