{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,27]],"date-time":"2025-09-27T13:51:59Z","timestamp":1758981119066,"version":"3.41.0"},"reference-count":32,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2018,12,4]],"date-time":"2018-12-04T00:00:00Z","timestamp":1543881600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["611370, 611649, 2015-05407"],"award-info":[{"award-number":["611370, 611649, 2015-05407"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012245","name":"Guangdong Science and Technology Program","doi-asserted-by":"crossref","award":["2015A030312015"],"award-info":[{"award-number":["2015A030312015"]}],"id":[{"id":"10.13039\/501100012245","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100011002","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61528208, 61602311, 61522213, 61432003, 61370143"],"award-info":[{"award-number":["61528208, 61602311, 61522213, 61432003, 61370143"]}],"id":[{"id":"10.13039\/501100011002","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shenzhen Innovation Program","award":["JCYJ20170302153208613, KQJSCX20170727101233642"],"award-info":[{"award-number":["JCYJ20170302153208613, KQJSCX20170727101233642"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2018,12,31]]},"abstract":"<jats:p>\n            We study a new and elegant instance of geometric dissection of 2D shapes:\n            <jats:italic>reversible hinged<\/jats:italic>\n            dissection, which corresponds to a\n            <jats:italic>dual transform<\/jats:italic>\n            between two shapes where one of them can be dissected in its interior and then inverted\n            <jats:italic>inside-out<\/jats:italic>\n            , with hinges on the shape boundary, to reproduce the other shape, and vice versa. We call such a transform\n            <jats:italic>reversible inside-out transform<\/jats:italic>\n            or RIOT. Since it is rare for two shapes to possess even a rough RIOT, let alone an exact one, we develop both a RIOT construction algorithm and a quick filtering mechanism to pick, from a shape collection, potential shape pairs that are likely to possess the transform. Our construction algorithm is\n            <jats:italic>fully automatic.<\/jats:italic>\n            It computes an\n            <jats:italic>approximate<\/jats:italic>\n            RIOT between two given input 2D shapes, whose boundaries can undergo slight deformations, while the filtering scheme picks good inputs for the construction. Furthermore, we add properly designed hinges and connectors to the shape pieces and fabricate them using a 3D printer so that they can be played as an assembly puzzle. With many interesting and fun RIOT pairs constructed from shapes found online, we demonstrate that our method significantly expands the range of shapes to be considered for RIOT, a seemingly impossible shape transform, and offers a practical way to construct and physically realize these transforms.\n          <\/jats:p>","DOI":"10.1145\/3272127.3275061","type":"journal-article","created":{"date-parts":[[2018,11,28]],"date-time":"2018-11-28T19:16:10Z","timestamp":1543432570000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Construction and fabrication of reversible shape transforms"],"prefix":"10.1145","volume":"37","author":[{"given":"Shuhua","family":"Li","sequence":"first","affiliation":[{"name":"Dalian University of Technology and Simon Fraser University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Mahdavi-Amiri","sequence":"additional","affiliation":[{"name":"Simon Fraser University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruizhen","family":"Hu","sequence":"additional","affiliation":[{"name":"Shenzhen University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Han","family":"Liu","sequence":"additional","affiliation":[{"name":"Simon Fraser University and Carleton University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changqing","family":"Zou","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oliver","family":"Van Kaick","sequence":"additional","affiliation":[{"name":"Carleton University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiuping","family":"Liu","sequence":"additional","affiliation":[{"name":"Dalian University of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Huang","sequence":"additional","affiliation":[{"name":"Shenzhen University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Zhang","sequence":"additional","affiliation":[{"name":"Simon Fraser University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,12,4]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_2_2_1_1","DOI":"10.5555\/3116263.3116421"},{"key":"e_1_2_2_2_1","volume-title":"Japanese Conference on Discrete and Computational Geometry and Graphs. Springer, 13--23","author":"Akiyama Jin","year":"2015","unstructured":"Jin Akiyama , Stefan Langerman , and Kiyoko Matsunaga . 2015 . Reversible nets of polyhedra . In Japanese Conference on Discrete and Computational Geometry and Graphs. Springer, 13--23 . Jin Akiyama, Stefan Langerman, and Kiyoko Matsunaga. 2015. Reversible nets of polyhedra. In Japanese Conference on Discrete and Computational Geometry and Graphs. Springer, 13--23."},{"volume-title":"Treks into Intuitive Geometry","author":"Akiyama Jin","unstructured":"Jin Akiyama and Kiyoko Matsunaga . 2015. Treks into Intuitive Geometry . Springer . Jin Akiyama and Kiyoko Matsunaga. 2015. Treks into Intuitive Geometry. Springer.","key":"e_1_2_2_3_1"},{"doi-asserted-by":"publisher","key":"e_1_2_2_4_1","DOI":"10.1007\/s00454-017-9876-9"},{"key":"e_1_2_2_5_1","volume-title":"Dudeney Dissections of Polygons and Polyhedrons-A Survey-. In Japanese Conference on Discrete and Computational Geometry. Springer, 1--30","author":"Akiyama Jin","year":"2000","unstructured":"Jin Akiyama and Gisaku Nakamura . 2000 . Dudeney Dissections of Polygons and Polyhedrons-A Survey-. In Japanese Conference on Discrete and Computational Geometry. Springer, 1--30 . Jin Akiyama and Gisaku Nakamura. 2000. Dudeney Dissections of Polygons and Polyhedrons-A Survey-. In Japanese Conference on Discrete and Computational Geometry. Springer, 1--30."},{"key":"e_1_2_2_6_1","volume-title":"Computation time comparison between matlab and C++ using launch windows. Research report submitted to American Institute of Aeronautics and Astronautics","author":"Andrews Tyler","year":"2012","unstructured":"Tyler Andrews . 2012. Computation time comparison between matlab and C++ using launch windows. Research report submitted to American Institute of Aeronautics and Astronautics , California Polytechnic State University San Luis Obispo ( 2012 ). Tyler Andrews. 2012. Computation time comparison between matlab and C++ using launch windows. Research report submitted to American Institute of Aeronautics and Astronautics, California Polytechnic State University San Luis Obispo (2012)."},{"doi-asserted-by":"publisher","key":"e_1_2_2_7_1","DOI":"10.1109\/ICCVW.2009.5457679"},{"key":"e_1_2_2_8_1","volume-title":"Zalgaller","author":"Burago Yurii D.","year":"2013","unstructured":"Yurii D. Burago and Viktor A . Zalgaller . 2013 . Geometric inequalities. Vol. 285 . Springer Science & Business Media . Yurii D. Burago and Viktor A. Zalgaller. 2013. Geometric inequalities. Vol. 285. Springer Science & Business Media."},{"doi-asserted-by":"publisher","key":"e_1_2_2_9_1","DOI":"10.1145\/2816795.2818087"},{"doi-asserted-by":"publisher","key":"e_1_2_2_10_1","DOI":"10.5555\/1090462.1646555"},{"doi-asserted-by":"publisher","key":"e_1_2_2_11_1","DOI":"10.3138\/FM57-6770-U75U-7727"},{"key":"e_1_2_2_12_1","volume-title":"Column in the Weekly Dispatch","author":"Dudeney Henry E.","year":"1902","unstructured":"Henry E. Dudeney . 1902 . Puzzles and prizes . Column in the Weekly Dispatch , April 19, 1896-March 27, 1904 (1902). Henry E. Dudeney. 1902. Puzzles and prizes. Column in the Weekly Dispatch, April 19, 1896-March 27, 1904 (1902)."},{"doi-asserted-by":"publisher","key":"e_1_2_2_13_1","DOI":"10.1145\/3130800.3130831"},{"doi-asserted-by":"publisher","key":"e_1_2_2_15_1","DOI":"10.1017\/CBO9780511574917"},{"key":"e_1_2_2_16_1","volume-title":"Hinged Dissections: Swinging and Twisting","author":"Frederickson Greg N.","year":"2002","unstructured":"Greg N. Frederickson . 2002 . Hinged Dissections: Swinging and Twisting . Cambridge University Press . Greg N. Frederickson. 2002. Hinged Dissections: Swinging and Twisting. Cambridge University Press."},{"doi-asserted-by":"publisher","key":"e_1_2_2_17_1","DOI":"10.1090\/S0002-9939-1985-0784187-9"},{"doi-asserted-by":"publisher","key":"e_1_2_2_18_1","DOI":"10.1109\/CVPR.2000.855850"},{"doi-asserted-by":"publisher","key":"e_1_2_2_19_1","DOI":"10.1145\/2010324.1964993"},{"doi-asserted-by":"publisher","key":"e_1_2_2_20_1","DOI":"10.1145\/2601097.2601224"},{"doi-asserted-by":"publisher","key":"e_1_2_2_21_1","DOI":"10.1109\/TSMC.1979.4310076"},{"doi-asserted-by":"publisher","key":"e_1_2_2_22_1","DOI":"10.1111\/j.1467-8659.2007.01103.x"},{"doi-asserted-by":"publisher","key":"e_1_2_2_23_1","DOI":"10.1145\/3130800.3130803"},{"doi-asserted-by":"publisher","key":"e_1_2_2_24_1","DOI":"10.1145\/1057432.1057456"},{"doi-asserted-by":"publisher","key":"e_1_2_2_25_1","DOI":"10.1145\/2766961"},{"doi-asserted-by":"publisher","key":"e_1_2_2_26_1","DOI":"10.1145\/2010324.1964985"},{"key":"e_1_2_2_27_1","volume-title":"Elements of Geometry","author":"Wallace William","unstructured":"William Wallace . 1831. Elements of Geometry ( 8 th ed.). Bell & Bradfute . William Wallace. 1831. Elements of Geometry (8th ed.). Bell & Bradfute.","edition":"8"},{"doi-asserted-by":"publisher","key":"e_1_2_2_28_1","DOI":"10.1145\/2010324.1964992"},{"doi-asserted-by":"publisher","key":"e_1_2_2_29_1","DOI":"10.1145\/3072959.3073673"},{"doi-asserted-by":"publisher","key":"e_1_2_2_30_1","DOI":"10.1145\/2601097.2601173"},{"key":"e_1_2_2_31_1","volume-title":"Proc. of Bridges Conf. 49--58","author":"Zhou Yahan","year":"2012","unstructured":"Yahan Zhou and Rui Wang . 2012 . An Algorithm for Creating Geometric Dissection Puzzles . In Proc. of Bridges Conf. 49--58 . Yahan Zhou and Rui Wang. 2012. An Algorithm for Creating Geometric Dissection Puzzles. In Proc. of Bridges Conf. 49--58."},{"doi-asserted-by":"publisher","key":"e_1_2_2_32_1","DOI":"10.1145\/2897824.2925887"},{"doi-asserted-by":"publisher","key":"e_1_2_2_33_1","DOI":"10.1109\/TPAMI.2004.19"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3272127.3275061","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3272127.3275061","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:44:04Z","timestamp":1750207444000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3272127.3275061"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,4]]},"references-count":32,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,12,31]]}},"alternative-id":["10.1145\/3272127.3275061"],"URL":"https:\/\/doi.org\/10.1145\/3272127.3275061","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"type":"print","value":"0730-0301"},{"type":"electronic","value":"1557-7368"}],"subject":[],"published":{"date-parts":[[2018,12,4]]},"assertion":[{"value":"2018-12-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}