{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T06:06:43Z","timestamp":1784268403667,"version":"3.55.0"},"reference-count":15,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2015,11,2]],"date-time":"2015-11-02T00:00:00Z","timestamp":1446422400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100012245","name":"Guangdong Science and Technology Program","doi-asserted-by":"crossref","award":["2015A030312015, 2014B050502009, 2014TX01X033"],"award-info":[{"award-number":["2015A030312015, 2014B050502009, 2014TX01X033"]}],"id":[{"id":"10.13039\/501100012245","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003977","name":"Israeli Science Foundation","doi-asserted-by":"crossref","award":["1790\/12"],"award-info":[{"award-number":["1790\/12"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"crossref"}]},{"name":"NSERC Canada","award":["611370"],"award-info":[{"award-number":["611370"]}]},{"name":"Shenzhen VisuCA Key Lab","award":["CXB201104220029A"],"award-info":[{"award-number":["CXB201104220029A"]}]},{"name":"U.S.-Israel Bi-National Science Foundation","award":["2012376"],"award-info":[{"award-number":["2012376"]}]},{"name":"National 973 Program","award":["2015CB352500"],"award-info":[{"award-number":["2015CB352500"]}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["61232011, 61202147, 61332015"],"award-info":[{"award-number":["61232011, 61202147, 61332015"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2015,11,4]]},"abstract":"<jats:p>\n            We pose the\n            <jats:italic>decompose-and-pack<\/jats:italic>\n            or\n            <jats:italic>DAP<\/jats:italic>\n            problem, which tightly combines shape decomposition and packing. While in general, DAP seeks to decompose an input shape into a\n            <jats:italic>small number<\/jats:italic>\n            of parts which can be\n            <jats:italic>efficiently<\/jats:italic>\n            packed, our focus is geared towards 3D printing. The goal is to optimally decompose-and-pack a 3D object into a printing volume to minimize support material, build time, and assembly cost. We present\n            <jats:italic>Dapper<\/jats:italic>\n            , a global optimization algorithm for the DAP problem which can be applied to both powder- and FDM-based 3D printing. The solution search is top-down and iterative. Starting with a coarse decomposition of the input shape into few initial parts, we progressively pack a pile in the printing volume, by iteratively docking parts, possibly while introducing cuts, onto the pile. Exploration of the search space is via a\n            <jats:italic>prioritized<\/jats:italic>\n            and\n            <jats:italic>bounded beam search<\/jats:italic>\n            , with breadth and depth pruning guided by local and global DAP objectives. A key feature of Dapper is that it works with\n            <jats:italic>pyramidal<\/jats:italic>\n            primitives, which are packing- and printing-friendly. Pyramidal shapes are also more general than boxes to reduce part counts, while still maintaining a suitable level of simplicity to facilitate DAP optimization. We demonstrate printing efficiency gains achieved by Dapper, compare to state-of-the-art alternatives, and show how fabrication criteria such as cut area and part size can be easily incorporated into our solution framework to produce more physically plausible fabrications.\n          <\/jats:p>","DOI":"10.1145\/2816795.2818087","type":"journal-article","created":{"date-parts":[[2015,10,27]],"date-time":"2015-10-27T12:36:39Z","timestamp":1445949399000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":94,"title":["Dapper"],"prefix":"10.1145","volume":"34","author":[{"given":"Xuelin","family":"Chen","sequence":"first","affiliation":[{"name":"Shandong Univ."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hao","family":"Zhang","sequence":"additional","affiliation":[{"name":"Simon Fraser Univ."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinjie","family":"Lin","sequence":"additional","affiliation":[{"name":"Shandong Univ."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ruizhen","family":"Hu","sequence":"additional","affiliation":[{"name":"Shenzhen Inst. of Adv. Tech."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lin","family":"Lu","sequence":"additional","affiliation":[{"name":"Shandong Univ."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qixing","family":"Huang","sequence":"additional","affiliation":[{"name":"Toyota Tech. Inst."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bedrich","family":"Benes","sequence":"additional","affiliation":[{"name":"Purdue Univ."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Cohen-Or","sequence":"additional","affiliation":[{"name":"Tel Aviv Univ."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Baoquan","family":"Chen","sequence":"additional","affiliation":[{"name":"Shandong Univ."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,11,2]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360855"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0010-4485(01)00109-9"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0262-8856(92)90066-C"},{"key":"e_1_2_1_4_1","unstructured":"Crainic T. G. Perboli G. and Tadei R. 2012. Recent Advances in Multi-Dimensional Packing Problems. New Technologies - Trends Innovations and Research.  Crainic T. G. Perboli G. and Tadei R. 2012. Recent Advances in Multi-Dimensional Packing Problems. New Technologies - Trends Innovations and Research."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1080\/10255810213478"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207540701277002"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2013.05.011"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0010-0277(84)90022-2"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661229.2661244"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2366145.2366148"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2007.01103.x"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12353"},{"key":"e_1_2_1_14_1","volume-title":"3D printing --- wikipedia, the free encyclopedia. {Online","author":"Wikipedia","year":"2014","unstructured":"Wikipedia , 2014. 3D printing --- wikipedia, the free encyclopedia. {Online ; accessed 6- November - 2014 }. Wikipedia, 2014. 3D printing --- wikipedia, the free encyclopedia. {Online; accessed 6-November-2014}."},{"key":"e_1_2_1_15_1","volume-title":"Proc. of Bridges Conf., 49--58","author":"Zhou Y.","unstructured":"Zhou , Y. , and Wang , R . 2012. An algorithm for creating geometric dissection puzzles . In Proc. of Bridges Conf., 49--58 . Zhou, Y., and Wang, R. 2012. An algorithm for creating geometric dissection puzzles. In Proc. of Bridges Conf., 49--58."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601097.2601173"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2816795.2818087","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2816795.2818087","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:18Z","timestamp":1750225698000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2816795.2818087"}},"subtitle":["decompose-and-pack for 3D printing"],"short-title":[],"issued":{"date-parts":[[2015,11,2]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,11,4]]}},"alternative-id":["10.1145\/2816795.2818087"],"URL":"https:\/\/doi.org\/10.1145\/2816795.2818087","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,2]]},"assertion":[{"value":"2015-11-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}