{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T17:34:48Z","timestamp":1777570488862,"version":"3.51.4"},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T00:00:00Z","timestamp":1259625600000},"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":[[2009,12]]},"abstract":"<jats:p>\"To them, I said, the truth would be literally nothing but the shadows of the images.\" -<jats:italic>Plato, The Republic<\/jats:italic><\/jats:p><jats:p>Shadow art is a unique form of sculptural art where the 2D shadows cast by a 3D sculpture are essential for the artistic effect. We introduce computational tools for the creation of shadow art and propose a design process where the user can directly specify the desired shadows by providing a set of binary images and corresponding projection information. Since multiple shadow images often contradict each other, we present a geometric optimization that computes a 3D shadow volume whose shadows best approximate the provided input images. Our analysis shows that this optimization is essential for obtaining physically realizable 3D sculptures. The resulting shadow volume can then be modified with a set of interactive editing tools that automatically respect the often intricate shadow constraints. We demonstrate the potential of our system with a number of complex 3D shadow art sculptures that go beyond what is seen in contemporary art pieces.<\/jats:p>","DOI":"10.1145\/1618452.1618502","type":"journal-article","created":{"date-parts":[[2009,12,8]],"date-time":"2009-12-08T20:53:14Z","timestamp":1260305594000},"page":"1-7","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":85,"title":["Shadow art"],"prefix":"10.1145","volume":"28","author":[{"given":"Niloy J.","family":"Mitra","sequence":"first","affiliation":[{"name":"IIT Delhi \/ KAUST"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Pauly","sequence":"additional","affiliation":[{"name":"ETH Zurich"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Clote P. and Kranakis E. 2002. Boolean Functions and Computation Models. Springer. Clote P. and Kranakis E. 2002. Boolean Functions and Computation Models . Springer.","DOI":"10.1007\/978-3-662-04943-3"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/508357.508362"},{"key":"e_1_2_1_3_1","volume-title":"Let The Shadows Speak","author":"Ewart F. G.","unstructured":"Ewart , F. G. 1998. Let The Shadows Speak . Trentham Books . Ewart, F. G. 1998. Let The Shadows Speak. Trentham Books."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1274871.1274873"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/122718.122747"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073204.1073323"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1596685.1596807"},{"key":"e_1_2_1_8_1","volume-title":"Proc. of Symp. of Geometry Processing, 125--133","author":"Kazhdan M.","unstructured":"Kazhdan , M. , Klein , A. , Dalal , K. , and Hoppe , H . 2007. Unconstrained isosurface extraction on arbitrary octrees . In Proc. of Symp. of Geometry Processing, 125--133 . Kazhdan, M., Klein, A., Dalal, K., and Hoppe, H. 2007. Unconstrained isosurface extraction on arbitrary octrees. In Proc. of Symp. of Geometry Processing, 125--133."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-006-0209-8"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008191222954"},{"key":"e_1_2_1_11_1","volume-title":"Proc. of CVPR Workshops.","author":"Ladikos A.","unstructured":"Ladikos , A. , Benhimane , S. , and Navab , N . 2008. Efficient visual hull computation for real-time 3D reconstruction using CUDA . In Proc. of CVPR Workshops. Ladikos, A., Benhimane, S., and Navab, N. 2008. Efficient visual hull computation for real-time 3D reconstruction using CUDA. In Proc. of CVPR Workshops."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.273735"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276377.1276456"},{"key":"e_1_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Olsen L. Samavati F. Sousa M. and Jorge J. 2008. Sketch-based modeling: A survey. Computers and Graphics. Olsen L. Samavati F. Sousa M. and Jorge J. 2008. Sketch-based modeling: A survey. Computers and Graphics .","DOI":"10.1016\/j.cag.2008.09.013"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/566654.566617"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/383259.383264"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/160985.161159"},{"key":"e_1_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Rusinkiewicz S. and Levoy M. 2001. Efficient variants of the ICP algorithm. 3DIM 145--152. Rusinkiewicz S. and Levoy M. 2001. Efficient variants of the ICP algorithm. 3DIM 145--152.","DOI":"10.1109\/IM.2001.924423"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-006-0095-2"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.159"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1360612.1360685"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/38.135913"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/147156.147161"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1618452.1618502","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1618452.1618502","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:23Z","timestamp":1750249403000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1618452.1618502"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2009,12]]}},"alternative-id":["10.1145\/1618452.1618502"],"URL":"https:\/\/doi.org\/10.1145\/1618452.1618502","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12]]},"assertion":[{"value":"2009-12-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}