Metropolis procedural modeling
Jerry O. Talton, Yu Lou, Steve Lesser, Jared Duke, Radomír Měch, Vladlen Koltun
In ACM Transactions on Graphics, 30(2), April 2011.
Abstract: Procedural representations provide powerful means for generating complex geometric structures. They are also notoriously difficult to control. In this article, we present an algorithm for controlling grammar-based procedural models. Given a grammar and a high-level specification of the desired production, the algorithm computes a production from the grammar that conforms to the specification. This production is generated by optimizing over the space of possible productions from the grammar. The algorithm supports specifications of many forms, including geometric shapes and analytical objectives. We demonstrate the algorithm on procedural models of trees, cities, buildings, and Mondrian paintings.
Keyword(s): Markov chain Monte Carlo, Procedural modeling, context-free grammars, geometry synthesis
Article URL: http://dx.doi.org/10.1145/1944846.1944851
BibTeX format:
@article{Talton:2011:MPM,
  author = {Jerry O. Talton and Yu Lou and Steve Lesser and Jared Duke and Radomír Měch and Vladlen Koltun},
  title = {Metropolis procedural modeling},
  journal = {ACM Transactions on Graphics},
  volume = {30},
  number = {2},
  pages = {11:1--11:14},
  month = apr,
  year = {2011},
}
Search for more articles by Jerry O. Talton.
Search for more articles by Yu Lou.
Search for more articles by Steve Lesser.
Search for more articles by Jared Duke.
Search for more articles by Radomír Měch.
Search for more articles by Vladlen Koltun.

Return to the search page.


graphbib: Powered by "bibsql" and "SQLite3."