{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T07:21:31Z","timestamp":1781335291781,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":54,"publisher":"ACM","funder":[{"name":"Japan Science and Technology Agency (JST) ASPIRE grant number","award":["JPMJAP2401"],"award-info":[{"award-number":["JPMJAP2401"]}]},{"name":"Japan Society for the Promotion of Science (JSPS) KAKENHI grant number","award":["JP23K19994"],"award-info":[{"award-number":["JP23K19994"]}]},{"name":"Mercari R4D Lab and RIISE (Research Institute for an Inclusive Society through Engineering)"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,20]]},"DOI":"10.1145\/3745778.3766653","type":"proceedings-article","created":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T10:43:02Z","timestamp":1763116982000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["ScrapReCover: An Interactive Optimization System for Freeform Patchwork Layouts"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-3432-8541","authenticated-orcid":false,"given":"Masahiro","family":"Kono","sequence":"first","affiliation":[{"name":"The University of Tokyo, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4375-473X","authenticated-orcid":false,"given":"Maria","family":"Larsson","sequence":"additional","affiliation":[{"name":"The University of Tokyo, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4201-3793","authenticated-orcid":false,"given":"I-Chao","family":"Shen","sequence":"additional","affiliation":[{"name":"The University of Tokyo, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5495-6441","authenticated-orcid":false,"given":"Takeo","family":"Igarashi","sequence":"additional","affiliation":[{"name":"The University of Tokyo, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,11,19]]},"reference":[{"key":"e_1_3_3_3_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330701"},{"key":"e_1_3_3_3_3_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.70204"},{"key":"e_1_3_3_3_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ADVCOMP.2009.19"},{"key":"e_1_3_3_3_5_1","first-page":"347","volume-title":"25th Annual Bridges Conference 2022: Mathematics, Art, Music, Architecture, Cullture","author":"Bakker Anton","year":"2022","unstructured":"Anton Bakker and Tom Verhoeff. 2022. Algorithms to Construct Designs for Foundation Paper Piecing of Quilt Patchwork Layers. In 25th Annual Bridges Conference 2022: Mathematics, Art, Music, Architecture, Cullture. Tessellations Publishing, 347\u2013350."},{"key":"e_1_3_3_3_6_1","doi-asserted-by":"crossref","unstructured":"Julia\u00a0A Bennell and Jose\u00a0F Oliveira. 2008. The geometry of nesting problems: A tutorial. European journal of operational research 184 2 (2008) 397\u2013415.","DOI":"10.1016\/j.ejor.2006.11.038"},{"key":"e_1_3_3_3_7_1","doi-asserted-by":"crossref","unstructured":"Julia\u00a0A Bennell and Xiang Song. 2010. A beam search implementation for the irregular shape packing problem. Journal of Heuristics 16 (2010) 167\u2013188.","DOI":"10.1007\/s10732-008-9095-x"},{"key":"e_1_3_3_3_8_1","doi-asserted-by":"crossref","unstructured":"Christian Blum and Andrea Roli. 2003. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM computing surveys (CSUR) 35 3 (2003) 268\u2013308.","DOI":"10.1145\/937503.937505"},{"key":"e_1_3_3_3_9_1","unstructured":"Ralf Bornd\u00f6rfer. 1998. Aspects of set packing partitioning and covering. Ph.\u00a0D. Dissertation."},{"key":"e_1_3_3_3_10_1","doi-asserted-by":"crossref","unstructured":"Stephen Boyd. 2004. Convex optimization. Cambridge UP (2004).","DOI":"10.1017\/CBO9780511804441"},{"key":"e_1_3_3_3_11_1","doi-asserted-by":"crossref","unstructured":"Chazelle. 1983. The bottomn-left bin-packing heuristic: An efficient implementation. IEEE transactions on computers 100 8 (1983) 697\u2013707.","DOI":"10.1109\/TC.1983.1676307"},{"key":"e_1_3_3_3_12_1","doi-asserted-by":"crossref","unstructured":"Vasek Chvatal. 1979. A greedy heuristic for the set-covering problem. Mathematics of operations research 4 3 (1979) 233\u2013235.","DOI":"10.1287\/moor.4.3.233"},{"key":"e_1_3_3_3_13_1","doi-asserted-by":"crossref","unstructured":"Claudio Contardo and Alain Hertz. 2021. An exact algorithm for a class of geometric set-cover problems. Discrete Applied Mathematics 300 (2021) 25\u201335.","DOI":"10.1016\/j.dam.2021.05.005"},{"key":"e_1_3_3_3_14_1","doi-asserted-by":"crossref","unstructured":"Joseph\u00a0C Culberson and Robert\u00a0A Reckhow. 1994. Covering polygons is hard. J. Algorithms 17 1 (1994) 2\u201344.","DOI":"10.1006\/jagm.1994.1025"},{"key":"e_1_3_3_3_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04245-8"},{"key":"e_1_3_3_3_16_1","doi-asserted-by":"crossref","unstructured":"Kathryn\u00a0A Dowsland. 1993. Some experiments with simulated annealing techniques for packing problems. European Journal of Operational Research 68 3 (1993) 389\u2013399.","DOI":"10.1016\/0377-2217(93)90195-S"},{"key":"e_1_3_3_3_17_1","doi-asserted-by":"crossref","unstructured":"Harald Dyckhoff. 1990. A typology of cutting and packing problems. European journal of operational research 44 2 (1990) 145\u2013159.","DOI":"10.1016\/0377-2217(90)90350-K"},{"key":"e_1_3_3_3_18_1","doi-asserted-by":"crossref","unstructured":"Robert\u00a0J Fowler Michael\u00a0S Paterson and Steven\u00a0L Tanimoto. 1981. Optimal packing and covering in the plane are NP-complete. Information processing letters 12 3 (1981) 133\u2013137.","DOI":"10.1016\/0020-0190(81)90111-3"},{"key":"e_1_3_3_3_19_1","doi-asserted-by":"crossref","unstructured":"Deborah\u00a0S Franzblau and Daniel\u00a0J Kleitman. 1984. An algorithm for covering polygons with rectangles. Information and control 63 3 (1984) 164\u2013189.","DOI":"10.1016\/S0019-9958(84)80012-1"},{"key":"e_1_3_3_3_20_1","doi-asserted-by":"crossref","unstructured":"A\u00a0Miguel Gomes and Jos\u00e9\u00a0F Oliveira. 2006. Solving irregular strip packing problems by hybridising simulated annealing and linear programming. European Journal of Operational Research 171 3 (2006) 811\u2013829.","DOI":"10.1016\/j.ejor.2004.09.008"},{"key":"e_1_3_3_3_21_1","doi-asserted-by":"publisher","DOI":"10.4324\/9780429498909-19"},{"key":"e_1_3_3_3_22_1","doi-asserted-by":"crossref","unstructured":"Baosu Guo Yu Zhang Jingwen Hu Jinrui Li Fenghe Wu Qingjin Peng and Quan Zhang. 2022. Two-dimensional irregular packing problems: A review. Frontiers in Mechanical Engineering 8 (2022) 966691.","DOI":"10.3389\/fmech.2022.966691"},{"key":"e_1_3_3_3_23_1","doi-asserted-by":"crossref","unstructured":"E Hopper and B Turton. 1999. A genetic algorithm for a 2D industrial packing problem. Computers & Industrial Engineering 37 1-2 (1999) 375\u2013378.","DOI":"10.1016\/S0360-8352(99)00097-2"},{"key":"e_1_3_3_3_24_1","doi-asserted-by":"crossref","unstructured":"Eva Hopper and Brian\u00a0CH Turton. 2001. A review of the application of meta-heuristic algorithms to 2D strip packing problems. Artificial Intelligence Review 16 (2001) 257\u2013300.","DOI":"10.1023\/A:1012590107280"},{"key":"e_1_3_3_3_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/941350.941367"},{"key":"e_1_3_3_3_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2787626.2792601"},{"key":"e_1_3_3_3_27_1","unstructured":"David\u00a0S Johnson. 1973. Near-optimal bin packing algorithms. Ph.\u00a0D. Dissertation. Massachusetts Institute of Technology."},{"key":"e_1_3_3_3_28_1","doi-asserted-by":"crossref","unstructured":"Scott Kirkpatrick C\u00a0Daniel Gelatt\u00a0Jr and Mario\u00a0P Vecchi. 1983. Optimization by simulated annealing. science 220 4598 (1983) 671\u2013680.","DOI":"10.1126\/science.220.4598.671"},{"key":"e_1_3_3_3_29_1","doi-asserted-by":"crossref","unstructured":"Bongjin Koo Jean Hergel Sylvain Lefebvre and Niloy\u00a0J Mitra. 2016. Towards zero-waste furniture design. IEEE transactions on visualization and computer graphics 23 12 (2016) 2627\u20132640.","DOI":"10.1109\/TVCG.2016.2633519"},{"key":"e_1_3_3_3_30_1","doi-asserted-by":"crossref","unstructured":"VS\u00a0Anil Kumar and H Ramesh. 2003. Covering rectilinear polygons with axis-parallel rectangles. SIAM J. Comput. 32 6 (2003) 1509\u20131541.","DOI":"10.1137\/S0097539799358835"},{"key":"e_1_3_3_3_31_1","doi-asserted-by":"crossref","unstructured":"Kin\u00a0Chung Kwan Lok\u00a0Tsun Sinn Chu Han Tien-Tsin Wong and Chi-Wing Fu. 2016. Pyramid of arclength descriptor for generating collage of shapes. ACM Trans. Graph. 35 6 (2016) 229\u20131.","DOI":"10.1145\/2980179.2980234"},{"key":"e_1_3_3_3_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3526113.3545643"},{"key":"e_1_3_3_3_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3654777.3676404"},{"key":"e_1_3_3_3_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3411764.3445601"},{"key":"e_1_3_3_3_35_1","first-page":"13","volume-title":"Graphics Interface","author":"Li Yifei","year":"2019","unstructured":"Yifei Li, David\u00a0E Breen, James McCann, and Jessica\u00a0K Hodgins. 2019. Algorithmic Quilting Pattern Generation for Pieced Quilts.. In Graphics Interface. 13\u20131."},{"key":"e_1_3_3_3_36_1","doi-asserted-by":"crossref","unstructured":"Max Limper Nicholas Vining and Alla Sheffer. 2018. Box cutter: atlas refinement for efficient packing via void elimination. ACM Trans. Graph. 37 4 (2018) 153.","DOI":"10.1145\/3197517.3201328"},{"key":"e_1_3_3_3_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3092919.3092925"},{"key":"e_1_3_3_3_38_1","unstructured":"Jon McCormack and Monika Schwarz. 2024. Piecing Generative Patterns Into Contemporary Quilts. (2024)."},{"key":"e_1_3_3_3_39_1","doi-asserted-by":"crossref","unstructured":"Holly McQuillan. 2020. Digital 3D design as a tool for augmenting zero-waste fashion design practice. International Journal of Fashion Design Technology and Education 13 1 (2020) 89\u2013100.","DOI":"10.1080\/17543266.2020.1737248"},{"key":"e_1_3_3_3_40_1","doi-asserted-by":"crossref","unstructured":"Holly McQuillan Jen Archer-Martin Greta Menzies Jo Bailey Karl Kane and E Fox\u00a0Derwin. 2018. Make\/Use: A system for open source user-modifiable zero waste fashion practice. Fashion Practice 10 1 (2018) 7\u201333.","DOI":"10.1080\/17569370.2017.1400320"},{"key":"e_1_3_3_3_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3641519.3657495"},{"key":"e_1_3_3_3_42_1","doi-asserted-by":"crossref","unstructured":"Yaghout Nourani and Bjarne Andresen. 1998. A comparison of simulated annealing cooling strategies. Journal of Physics A: Mathematical and General 31 41 (1998) 8373.","DOI":"10.1088\/0305-4470\/31\/41\/011"},{"key":"e_1_3_3_3_43_1","doi-asserted-by":"crossref","unstructured":"JF Oliveira AM Gomes and JS Ferreira. 2000. TOPOS \u2013 A new constructive algorithm for nesting problems. OR SPEKTRUM 22 (2000) 263\u2013284.","DOI":"10.1007\/s002910050105"},{"key":"e_1_3_3_3_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3721238.3730703"},{"key":"e_1_3_3_3_45_1","doi-asserted-by":"crossref","unstructured":"Rob\u00a0A Rutenbar. 1989. Simulated annealing algorithms: An overview. IEEE Circuits and Devices magazine 5 1 (1989) 19\u201326.","DOI":"10.1109\/101.17235"},{"key":"e_1_3_3_3_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2501988.2501990"},{"key":"e_1_3_3_3_47_1","doi-asserted-by":"crossref","unstructured":"Bart Selman and Carla\u00a0P Gomes. 2006. Hill-climbing search. Encyclopedia of cognitive science 81 333-335 (2006) 10.","DOI":"10.1002\/0470018860.s00015"},{"key":"e_1_3_3_3_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3411764.3445345"},{"key":"e_1_3_3_3_49_1","unstructured":"Musashi Shinjo Maria Larsson and Hironori Yoshida. 2024. A Design and Fabrication Workflow for Upcycling Leftover Fabrics as Mosaic Art. (2024)."},{"key":"e_1_3_3_3_50_1","doi-asserted-by":"crossref","unstructured":"Nadav Shragai and Gershon Elber. 2013. Geometric covering. Computer-Aided Design 45 2 (2013) 243\u2013251.","DOI":"10.1016\/j.cad.2012.10.007"},{"key":"e_1_3_3_3_51_1","unstructured":"Ryo Suzuki. 2020. Siv3D: C++ Library for creative coding."},{"key":"e_1_3_3_3_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2807442.2807467"},{"key":"e_1_3_3_3_53_1","doi-asserted-by":"crossref","unstructured":"Kevin Tole Rashad Moqa Jiongzhi Zheng and Kun He. 2023. A simulated annealing approach for the circle bin packing problem with rectangular items. Computers & Industrial Engineering 176 (2023) 109004.","DOI":"10.1016\/j.cie.2023.109004"},{"key":"e_1_3_3_3_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3411764.3445187"},{"key":"e_1_3_3_3_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3654777.3676395"}],"event":{"name":"SCF '25: ACM Symposium on Computational Fabrication","location":"Cambridge MA USA","acronym":"SCF '25","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques"]},"container-title":["Proceedings of the ACM Symposium on Computational Fabrication"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3745778.3766653","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T20:52:44Z","timestamp":1767905564000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3745778.3766653"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,19]]},"references-count":54,"alternative-id":["10.1145\/3745778.3766653","10.1145\/3745778"],"URL":"https:\/\/doi.org\/10.1145\/3745778.3766653","relation":{},"subject":[],"published":{"date-parts":[[2025,11,19]]},"assertion":[{"value":"2025-11-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}