{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T00:17:05Z","timestamp":1767831425262,"version":"3.49.0"},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013,1]]},"abstract":"<jats:p>We introduce a framework to generate many variations of a facade design that look similar to a given facade layout. Starting from an input image, the facade is hierarchically segmented and labeled with a collection of manual and automatic tools. The user can then model constraints that should be maintained in any variation of the input facade design. Subsequently, facade variations are generated for different facade sizes, where multiple variations can be produced for a certain size. Computing such new facade variations has many unique challenges, and we propose a new algorithm based on interleaving heuristic search and quadratic programming. In contrast to most previous work, we focus on the generation of new design variations and not on the automatic analysis of the input's structure. Adding a modeling step with the user in the loop ensures that our results routinely are of high quality.<\/jats:p>","DOI":"10.1145\/2421636.2421644","type":"journal-article","created":{"date-parts":[[2013,2,19]],"date-time":"2013-02-19T14:32:37Z","timestamp":1361284357000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":47,"title":["Procedural facade variations from a single layout"],"prefix":"10.1145","volume":"32","author":[{"given":"Fan","family":"Bao","sequence":"first","affiliation":[{"name":"Arizona State University"}]},{"given":"Michael","family":"Schwarz","sequence":"additional","affiliation":[{"name":"Arizona State University and Cornell University"}]},{"given":"Peter","family":"Wonka","sequence":"additional","affiliation":[{"name":"Arizona State University and KAUST"}]}],"member":"320","published-online":{"date-parts":[[2013,2,7]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2007.1024"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2011.01886.x"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1778765.1778841"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2185520.2185574"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2009.01386.x"},{"key":"e_1_2_2_6_1","unstructured":"Gaspero L. D. 2009. QuadProg&plus;&plus; 1.2. http:\/\/sourceforge.net\/projects\/quadprog\/.  Gaspero L. D. 2009. QuadProg&plus;&plus; 1.2. http:\/\/sourceforge.net\/projects\/quadprog\/."},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02591962"},{"key":"e_1_2_2_8_1","doi-asserted-by":"crossref","unstructured":"LaValle S. M. 2006. Planning Algorithms. Cambridge University Press New York.   LaValle S. M. 2006. Planning Algorithms. Cambridge University Press New York.","DOI":"10.1017\/CBO9780511546877"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1778765.1778821"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2070781.2024217"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1360612.1360701"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1230100.1230119"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1409060.1409111"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1882261.1866203"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2010324.1964982"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1080\/03052150214016"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141911.1141931"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276377.1276484"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2012.03045.x"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/192161.192254"},{"key":"e_1_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Prusinkiewicz P. and Lindenmayer A. 1990. The Algorithmic Beauty of Plants. Springer-Verlag New York.   Prusinkiewicz P. and Lindenmayer A. 1990. The Algorithmic Beauty of Plants. Springer-Verlag New York.","DOI":"10.1007\/978-1-4613-8476-2"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/383259.383291"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2009.01636.x"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1068\/b070209"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1944846.1944851"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCG.2008.58"},{"key":"e_1_2_2_27_1","unstructured":"Wei L.-Y. Lefebvre S. Kwatra V. and Turk G. 2009. State of the art in example-based texture synthesis. In Eurographics 2009 Annex (State of The Art Reports). 93--117.  Wei L.-Y. Lefebvre S. Kwatra V. and Turk G. 2009. State of the art in example-based texture synthesis. In Eurographics 2009 Annex (State of The Art Reports). 93--117."},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882324"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2010324.1964981"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2421636.2421644","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2421636.2421644","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:34Z","timestamp":1750234714000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2421636.2421644"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["10.1145\/2421636.2421644"],"URL":"https:\/\/doi.org\/10.1145\/2421636.2421644","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1]]},"assertion":[{"value":"2011-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-07-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-02-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}