Key points are not available for this paper at this time.
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.
Building similarity graph...
Analyzing shared references across papers
Loading...
Jerry O. Talton
University of Illinois Urbana-Champaign
Yu Lou
Southwestern University of Finance and Economics
Steve Lesser
Stanford University
ACM Transactions on Graphics
Stanford University
Adobe Systems (United States)
Building similarity graph...
Analyzing shared references across papers
Loading...
Talton et al. (Fri,) studied this question.
synapsesocial.com/papers/6a14f2b127e17ac3bc9ae2b2 — DOI: https://doi.org/10.1145/1944846.1944851
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: