WEKO3
アイテム
Flat Folding a Strip with Parallel or Nonacute Zigzag Creases with Mountain-Valley Assignment
https://ipsj.ixsq.nii.ac.jp/records/208822
https://ipsj.ixsq.nii.ac.jp/records/20882209fcf018-0d3c-484e-8919-273d8fef9846
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
Copyright (c) 2020 by the Information Processing Society of Japan
|
|
オープンアクセス |
Item type | Journal(1) | |||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
公開日 | 2020-12-15 | |||||||||||||||||||
タイトル | ||||||||||||||||||||
タイトル | Flat Folding a Strip with Parallel or Nonacute Zigzag Creases with Mountain-Valley Assignment | |||||||||||||||||||
タイトル | ||||||||||||||||||||
言語 | en | |||||||||||||||||||
タイトル | Flat Folding a Strip with Parallel or Nonacute Zigzag Creases with Mountain-Valley Assignment | |||||||||||||||||||
言語 | ||||||||||||||||||||
言語 | eng | |||||||||||||||||||
キーワード | ||||||||||||||||||||
主題Scheme | Other | |||||||||||||||||||
主題 | [特集:離散と計算の幾何・グラフ・ゲーム] origami, crease pattern, flat folding, algorithm | |||||||||||||||||||
資源タイプ | ||||||||||||||||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||||||||||||
資源タイプ | journal article | |||||||||||||||||||
著者所属 | ||||||||||||||||||||
Massachusetts Institute of Technology | ||||||||||||||||||||
著者所属 | ||||||||||||||||||||
Massachusetts Institute of Technology | ||||||||||||||||||||
著者所属 | ||||||||||||||||||||
The University of Electro-Communications | ||||||||||||||||||||
著者所属 | ||||||||||||||||||||
Meiji University | ||||||||||||||||||||
著者所属 | ||||||||||||||||||||
ECBEING CORP. | ||||||||||||||||||||
著者所属 | ||||||||||||||||||||
The University of Tokyo | ||||||||||||||||||||
著者所属 | ||||||||||||||||||||
The University of Electro-Communications | ||||||||||||||||||||
著者所属(英) | ||||||||||||||||||||
en | ||||||||||||||||||||
Massachusetts Institute of Technology | ||||||||||||||||||||
著者所属(英) | ||||||||||||||||||||
en | ||||||||||||||||||||
Massachusetts Institute of Technology | ||||||||||||||||||||
著者所属(英) | ||||||||||||||||||||
en | ||||||||||||||||||||
The University of Electro-Communications | ||||||||||||||||||||
著者所属(英) | ||||||||||||||||||||
en | ||||||||||||||||||||
Meiji University | ||||||||||||||||||||
著者所属(英) | ||||||||||||||||||||
en | ||||||||||||||||||||
ECBEING CORP. | ||||||||||||||||||||
著者所属(英) | ||||||||||||||||||||
en | ||||||||||||||||||||
The University of Tokyo | ||||||||||||||||||||
著者所属(英) | ||||||||||||||||||||
en | ||||||||||||||||||||
The University of Electro-Communications | ||||||||||||||||||||
著者名 |
Erik, D. Demaine
× Erik, D. Demaine
× Martin, L. Demaine
× Hiro, Ito
× Chie, Nara
× Izumi, Shirahama
× Tomohiro, Tachi
× Mizuho, Tomura
|
|||||||||||||||||||
著者名(英) |
Erik, D. Demaine
× Erik, D. Demaine
× Martin, L. Demaine
× Hiro, Ito
× Chie, Nara
× Izumi, Shirahama
× Tomohiro, Tachi
× Mizuho, Tomura
|
|||||||||||||||||||
論文抄録 | ||||||||||||||||||||
内容記述タイプ | Other | |||||||||||||||||||
内容記述 | Deciding flat foldability of a given mountain-valley pattern is known to be NP-complete. One special case known to be solvable in linear time is when the creases are parallel to each other and perpendicular to two sides of a rectangular piece of paper; this case reduces to a purely one-dimensional folding problem. In this paper, we give linear-time algorithms for flat foldability in two more-general special cases: (1) all creases are parallel to each other and to two sides of a parallelogram of paper, but possibly oblique to the other two sides of the parallelogram; and (2) creases form a regular zigzag whose two directions (zig and zag, again possibly oblique to the two sides of the piece of paper) form nonacute angles to each other. In the latter zigzag case, we in fact prove that every crease pattern can be folded flat, even if each crease is specified as mountain, valley, or unfolded. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.28(2020) (online) DOI http://dx.doi.org/10.2197/ipsjjip.28.825 ------------------------------ |
|||||||||||||||||||
論文抄録(英) | ||||||||||||||||||||
内容記述タイプ | Other | |||||||||||||||||||
内容記述 | Deciding flat foldability of a given mountain-valley pattern is known to be NP-complete. One special case known to be solvable in linear time is when the creases are parallel to each other and perpendicular to two sides of a rectangular piece of paper; this case reduces to a purely one-dimensional folding problem. In this paper, we give linear-time algorithms for flat foldability in two more-general special cases: (1) all creases are parallel to each other and to two sides of a parallelogram of paper, but possibly oblique to the other two sides of the parallelogram; and (2) creases form a regular zigzag whose two directions (zig and zag, again possibly oblique to the two sides of the piece of paper) form nonacute angles to each other. In the latter zigzag case, we in fact prove that every crease pattern can be folded flat, even if each crease is specified as mountain, valley, or unfolded. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.28(2020) (online) DOI http://dx.doi.org/10.2197/ipsjjip.28.825 ------------------------------ |
|||||||||||||||||||
書誌レコードID | ||||||||||||||||||||
収録物識別子タイプ | NCID | |||||||||||||||||||
収録物識別子 | AN00116647 | |||||||||||||||||||
書誌情報 |
情報処理学会論文誌 巻 61, 号 12, 発行日 2020-12-15 |
|||||||||||||||||||
ISSN | ||||||||||||||||||||
収録物識別子タイプ | ISSN | |||||||||||||||||||
収録物識別子 | 1882-7764 |