Technical Companion to Example-Based Procedural Modeling Using Graph Grammars
Paul Merrell

TL;DR
This paper provides a detailed theoretical analysis and implementation insights for example-based procedural modeling using graph grammars, addressing complex algorithmic decisions and problem-solving capabilities.
Contribution
It offers a deeper theoretical exploration and implementation discussion complementing the previous work on graph grammar-based procedural modeling.
Findings
Proves the algorithm can solve specific classes of problems.
Discusses the rationale behind key algorithmic decisions.
Examines theoretical questions related to graph grammar applications.
Abstract
This is a companion piece to my paper on "Example-Based Procedural Modeling Using Graph Grammars." This paper examines some of the theoretical issues in more detail. This paper discusses some more complex parts of the implementation, why certain algorithmic decisions were made, proves the algorithm can solve certain classes of problems, and examines other interesting theoretical questions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsModel-Driven Software Engineering Techniques · Software Engineering Research · Software Testing and Debugging Techniques
