{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T07:36:40Z","timestamp":1778657800865,"version":"3.51.4"},"reference-count":30,"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"}],"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 introduce a computational solution for cost-efficient 3D fabrication using\n            <jats:italic>universal building blocks.<\/jats:italic>\n            Our key idea is to employ a set of universal blocks, which can be massively prefabricated at a low cost, to quickly assemble and constitute a significant\n            <jats:italic>internal core<\/jats:italic>\n            of the target object, so that only the\n            <jats:italic>residual volume<\/jats:italic>\n            need to be 3D printed online. We further improve the fabrication efficiency by decomposing the residual volume into a small number of printing-friendly pyramidal pieces. Computationally, we face a\n            <jats:italic>coupled decomposition<\/jats:italic>\n            problem: decomposing the input object into an internal core and residual, and decomposing the residual, to fulfill a combination of objectives for efficient 3D fabrication. To this end, we formulate an optimization that jointly minimizes the residual volume, the number of pyramidal residual pieces, and the amount of support waste when printing the residual pieces. To solve the optimization in a tractable manner, we start with a maximal internal core and iteratively refine it with local cuts to minimize the cost function. Moreover, to efficiently explore the large search space, we resort to cost estimates aided by pre-computation and avoid the need to explicitly construct pyramidal decompositions for each solution candidate. Results show that our method can iteratively reduce the estimated printing time and cost, as well as the support waste, and helps to save hours of fabrication time and much material consumption.\n          <\/jats:p>","DOI":"10.1145\/3272127.3275033","type":"journal-article","created":{"date-parts":[[2018,11,28]],"date-time":"2018-11-28T19:16:10Z","timestamp":1543432570000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["3D fabrication with universal building blocks and pyramidal shells"],"prefix":"10.1145","volume":"37","author":[{"given":"Xuelin","family":"Chen","sequence":"first","affiliation":[{"name":"Shandong University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Honghua","family":"Li","sequence":"additional","affiliation":[{"name":"Alibaba AI Labs"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chi-Wing","family":"Fu","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Zhang","sequence":"additional","affiliation":[{"name":"Simon Fraser University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Cohen-Or","sequence":"additional","affiliation":[{"name":"Tel Aviv University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baoquan","family":"Chen","sequence":"additional","affiliation":[{"name":"Peking University and Shandong University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,12,4]]},"reference":[{"key":"e_1_2_2_1_1","volume-title":"Order Independent Transparency with Dual Depth Peeling. Tech. rep","author":"Bavoil Louis","unstructured":"Louis Bavoil and Kevin Myers . 2008. Order Independent Transparency with Dual Depth Peeling. Tech. rep ., NVIDIA Corp . Louis Bavoil and Kevin Myers. 2008. Order Independent Transparency with Dual Depth Peeling. Tech. rep., NVIDIA Corp."},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13146"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2702123.2702225"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2816795.2818087"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1778765.1778782"},{"key":"e_1_2_2_6_1","volume-title":"Real-Time Collision Detection","author":"Ericson Christer","unstructured":"Christer Ericson . 2004. Real-Time Collision Detection . CRC Press . Christer Ericson. 2004. Real-Time Collision Detection. CRC Press."},{"key":"e_1_2_2_7_1","volume-title":"Interactive order-independent transparency. Tech. rep","author":"Everitt Cass","unstructured":"Cass Everitt . 2001. Interactive order-independent transparency. Tech. rep ., NVIDIA Corp . Cass Everitt. 2001. Interactive order-independent transparency. Tech. rep., NVIDIA Corp."},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1778765.1778781"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12556"},{"key":"e_1_2_2_10_1","volume-title":"Krogh","author":"Hertz John","year":"1991","unstructured":"John Hertz , Richard G. Palmer , and Anders S . Krogh . 1991 . Introduction to the Theory of Neural Computation (1st ed.). Perseus Publishing . John Hertz, Richard G. Palmer, and Anders S. Krogh. 1991. Introduction to the Theory of Neural Computation (1st ed.). Perseus Publishing."},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661229.2661244"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13242"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601097.2601168"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2366145.2366148"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2816795.2818091"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2556288.2557005"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2461912.2461957"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1778765.1778783"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897824.2925876"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2185520.2185544"},{"key":"e_1_2_2_21_1","unstructured":"Ultimaker ltd. 2017. Cura Software. https:\/\/ultimaker.com\/en\/products\/cura-software  Ultimaker ltd. 2017. Cura Software. https:\/\/ultimaker.com\/en\/products\/cura-software"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12353"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12810"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508363.2508382"},{"key":"e_1_2_2_25_1","unstructured":"Eric W. Weisstein. 2016. Space-Filling Polyhedron. From MathWorld---A Wolfram Web Resource. http:\/\/mathworld.wolfram.com\/Space-FillingPolyhedron.html {Online; accessed 13-December-2016}.  Eric W. Weisstein. 2016. Space-Filling Polyhedron. From MathWorld---A Wolfram Web Resource. http:\/\/mathworld.wolfram.com\/Space-FillingPolyhedron.html {Online; accessed 13-December-2016}."},{"key":"e_1_2_2_26_1","volume-title":"The Free Encyclopedia. https:\/\/en.wikipedia.org\/w\/index.php?title=Prefabrication {Online","author":"Wikipedia Prefabrication","year":"2016","unstructured":"Wikipedia. 2016. Prefabrication --- Wikipedia , The Free Encyclopedia. https:\/\/en.wikipedia.org\/w\/index.php?title=Prefabrication {Online ; accessed 4- December - 2016 }. Wikipedia. 2016. Prefabrication --- Wikipedia, The Free Encyclopedia. https:\/\/en.wikipedia.org\/w\/index.php?title=Prefabrication {Online; accessed 4-December-2016}."},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2816795.2818064"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cagd.2015.03.012"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmapro.2013.05.009"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.gmod.2014.03.009"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3272127.3275033","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3272127.3275033","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.3275033"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,4]]},"references-count":30,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,12,31]]}},"alternative-id":["10.1145\/3272127.3275033"],"URL":"https:\/\/doi.org\/10.1145\/3272127.3275033","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"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"}}]}}