Metropolis procedural modeling

  • Authors:
  • Jerry O. Talton;Yu Lou;Steve Lesser;Jared Duke;Radomír Měch;Vladlen Koltun

  • Affiliations:
  • Stanford University, Stanford, CA;Stanford University, Stanford, CA;Stanford University, Stanford, CA;Stanford University, Stanford, CA;Adobe Systems;Stanford University, Stanford, CA

  • Venue:
  • ACM Transactions on Graphics (TOG)
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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.