Folding a paper strip to minimize thickness

Journal of Discrete Algorithms - Tập 36 - Trang 18-26 - 2016
Erik D. Demaine1, David Eppstein2, Adam Hesterberg3, Hiro Ito4, Anna Lubiw5, Ryuhei Uehara6, Yushi Uno7
1Computer Science and Artificial Intelligence Lab, Massachusetts Institute of Technology, Cambridge, USA
2Computer Science Department, University of California, Irvine, USA
3Department of Mathematics, Massachusetts Institute of Technology, USA
4School of Informatics and Engineering, University of Electro-Communications, Tokyo, Japan
5David R. Cheriton School of Computer Science, University of Waterloo, Ontario, Canada
6School of Information Science, Japan Advanced Institute of Science and Technology, Ishikawa, Japan
7Graduate School of Science, Osaka Prefecture University, Osaka, Japan

Tài liệu tham khảo

Arkin, 2004, When can you fold a map?, Comput. Geom., 29, 23, 10.1016/j.comgeo.2004.03.012 Bern, 1996, The complexity of flat origami, 175 Demaine, 2007 Gallivan, 2002 Garey, 1979 Uehara, 2010, On stretch minimization problem on unit strip paper, 223 Uehara, 2011, Stamp foldings with a given mountain–valley assignment, 585 Umesato, 2013, The complexity of the stamp folding problem, Theor. Comput. Sci., 497, 13, 10.1016/j.tcs.2012.08.006
Thông tin
Thông tin xuất bản

Journal of Discrete Algorithms

Tập 36

18-26

Thông tin tác giả