Construction and fabrication of reversible shape transforms
暂无分享,去创建一个
Hui Huang | Hao Zhang | Han Liu | Xiuping Liu | Ali Mahdavi-Amiri | Oliver van Kaick | Ruizhen Hu | Changqing Zou | Shuhua Li
[1] Jin Akiyama,et al. Treks into Intuitive Geometry , 2015 .
[2] Maarten Löffler,et al. The Connect-The-Dots family of puzzles , 2014, ACM Trans. Graph..
[3] Ping Tan,et al. Legible compact calligrams , 2016, ACM Trans. Graph..
[4] Zhuowen Tu,et al. Integrating contour and skeleton for shape classification , 2009, 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops.
[5] Sai-Kit Yeung,et al. Approximate dissections , 2017, ACM Trans. Graph..
[6] Jin Akiyama,et al. Dudeney Dissections of Polygons and Polyhedrons - A Survey , 2000, JCDCG.
[7] Shi-Min Hu,et al. A geometric study of v-style pop-ups: theories and algorithms , 2011, ACM Trans. Graph..
[8] Timothy Sun,et al. Computational design of twisty joints and puzzles , 2015, ACM Trans. Graph..
[9] Ulrich Eckhardt,et al. Shape descriptors for non-rigid shapes with a single closed contour , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).
[10] Paul L. Rosin,et al. A new convexity measure for polygons , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[11] Peng Song,et al. Reconfigurable interlocking furniture , 2017, ACM Trans. Graph..
[12] Keenan Crane,et al. Computational design of telescoping structures , 2017, ACM Trans. Graph..
[13] Petery Cromwell. Dissections: plane and fancy , by Greg N. Frederickson. Pp. 310. £19.95. 1998. ISBN 0 521 57197 9 (Cambridge University Press). , 1997 .
[14] Ariel Shamir,et al. A survey on Mesh Segmentation Techniques , 2008, Comput. Graph. Forum.
[15] Christian Rössl,et al. Laplacian surface editing , 2004, SGP '04.
[16] D. Cohen-Or,et al. Dapper , 2015, ACM Trans. Graph..
[17] David Eppstein,et al. Hinged dissections of polyominoes and polyforms , 1999, CCCG.
[18] Wojciech Matusik,et al. Boxelization: folding 3D objects into boxes , 2014, ACM Trans. Graph..
[19] Erik D. Demaine,et al. Hinged Dissections Exist , 2007, SCG '08.
[20] N. Otsu. A threshold selection method from gray level histograms , 1979 .
[21] Takeo Igarashi,et al. Sensitive couture for interactive garment modeling and editing , 2011, ACM Trans. Graph..
[22] Yahan Zhou and Rui Wang,et al. An Algorithm for Creating Geometric Dissection Puzzles , 2012 .
[23] Richard J. Gardner,et al. A problem of Sallee on equidecomposable convex bodies , 1985 .
[24] Jin Akiyama,et al. Generalization of Haberdasher’s Puzzle , 2017, Discret. Comput. Geom..
[25] Stefan Langerman,et al. Reversible Nets of Polyhedra , 2015, JCDCGG.
[26] David H. Douglas,et al. ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .
[27] H. Mannila,et al. Computing Discrete Fréchet Distance ∗ , 1994 .
[28] Chi-Wing Fu,et al. Making burr puzzles from 3D models , 2011, ACM Trans. Graph..
[29] Tyler Andrews,et al. Computation Time Comparison Between Matlab and C++ Using Launch Windows , 2012 .