{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T20:41:28Z","timestamp":1778791288718,"version":"3.51.4"},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2012,7,1]],"date-time":"2012-07-01T00:00:00Z","timestamp":1341100800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["HR0011-11-C-0007-P00003"],"award-info":[{"award-number":["HR0011-11-C-0007-P00003"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-09-1-0124"],"award-info":[{"award-number":["N00014-09-1-0124"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2012,8,5]]},"abstract":"<jats:p>\n            We present a novel Markov chain Monte Carlo (MCMC) algorithm that generates samples from transdimensional distributions encoding complex constraints. We use factor graphs, a type of graphical model, to encode constraints as factors. Our proposed MCMC method, called locally annealed reversible jump MCMC, exploits knowledge of how dimension changes affect the structure of the factor graph. We employ a sequence of annealed distributions during the sampling process, allowing us to explore the state space across different dimensionalities more freely. This approach is motivated by the application of layout synthesis where relationships between objects are characterized as constraints. In particular, our method addresses the challenge of synthesizing\n            <jats:italic>open world<\/jats:italic>\n            layouts where the number of objects are not fixed and optimal configurations for different numbers of objects may be drastically different. We demonstrate the applicability of our approach on two open world layout synthesis problems: coffee shops and golf courses.\n          <\/jats:p>","DOI":"10.1145\/2185520.2185552","type":"journal-article","created":{"date-parts":[[2012,8,6]],"date-time":"2012-08-06T18:11:37Z","timestamp":1344276697000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":109,"title":["Synthesizing open worlds with constraints using locally annealed reversible jump MCMC"],"prefix":"10.1145","volume":"31","author":[{"given":"Yi-Ting","family":"Yeh","sequence":"first","affiliation":[{"name":"Stanford University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lingfeng","family":"Yang","sequence":"additional","affiliation":[{"name":"Stanford University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Watson","sequence":"additional","affiliation":[{"name":"Stanford University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noah D.","family":"Goodman","sequence":"additional","affiliation":[{"name":"Stanford University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pat","family":"Hanrahan","sequence":"additional","affiliation":[{"name":"Stanford University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,7]]},"reference":[{"key":"e_1_2_2_1_1","unstructured":"Alexander C. Ishikawa S. and Silverstein M. 1977. A Pattern Language: Towns Buildings Construction. Oxford University Press New York.  Alexander C. Ishikawa S. and Silverstein M. 1977. A Pattern Language: Towns Buildings Construction . Oxford University Press New York."},{"key":"e_1_2_2_2_1","volume-title":"Proceedings of the Proceedings of the Nineteenth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-03)","author":"Frey B.","year":"2003"},{"key":"e_1_2_2_3_1","first-page":"333","article-title":"The chain graph Markov property","volume":"17","author":"Frydenberg M.","year":"1990","journal-title":"Scandinavian Journal of Statistics"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1984.4767596"},{"key":"e_1_2_2_5_1","first-page":"220","article-title":"Church: a language for generative models","volume":"2008","author":"Goodman N. D.","year":"2008","journal-title":"Uncertainty in Artificial Intelligence"},{"key":"e_1_2_2_6_1","unstructured":"Graves R. and Cornish G. 1998. Golf course design. J. Wiley.  Graves R. and Cornish G. 1998. Golf course design . J. Wiley."},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/88.4.1035"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/82.4.711"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/57.1.97"},{"key":"e_1_2_2_10_1","unstructured":"Koller D. and Friedman N. 2009. Probabilistic graphical models. MIT Press.   Koller D. and Friedman N. 2009. Probabilistic graphical models . MIT Press."},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2000.10473908"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008929526011"},{"key":"e_1_2_2_14_1","volume-title":"FACTORIE: Probabilistic programming via imperatively defined factor graphs. In Advances in Neural Information Processing Systems 22","author":"McCallum A.","year":"2009"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2010324.1964982"},{"key":"e_1_2_2_16_1","volume-title":"IJCAI'05: Proceedings of the 19th international joint conference on Artificial intelligence, Morgan Kaufmann Publishers Inc.","author":"Milch B."},{"key":"e_1_2_2_17_1","first-page":"3","article-title":"On Metropolis-Hastings algorithms with delayed rejection","volume":"59","author":"Mira A.","year":"2001","journal-title":"Metron"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00143556"},{"key":"e_1_2_2_19_1","volume-title":"AAAI'07","author":"Pfeffer A.","year":"2007"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-5833-1"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1944846.1944851"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1111\/1467-9469.00232"},{"key":"e_1_2_2_23_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\/2185520.2185552","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2185520.2185552","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:47Z","timestamp":1750241207000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2185520.2185552"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,8,5]]}},"alternative-id":["10.1145\/2185520.2185552"],"URL":"https:\/\/doi.org\/10.1145\/2185520.2185552","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7]]},"assertion":[{"value":"2012-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}