Lune

SIGGRAPH2023Top-tier venue

Example-Based Procedural Modeling Using Graph Grammars

Paul Merrell

2023Year
18Citations
2Top-tier citations

Abstract

Fig. 1. From an example shape (a), our method automatically generates a graph grammar (b) that produces shapes (c) that are locally similar to the example. The graph grammar consists of rules that transform graphs. The graphs are converted into a planar graph drawing to produce the final shape.

We present a method for automatically generating polygonal shapes from an example using a graph grammar. Most procedural modeling techniques use grammars with manually created rules, but our method can create them automatically from an example. Our graph grammars generate graphs that are locally similar to a given example. We disassemble the input into small pieces called primitives and then reassemble the primitives into new graphs. We organize all possible locally similar graphs into a hierarchy and find matching graphs within the hierarchy. These matches are used to create a graph grammar that can construct every locally similar graph. Our method generates graphs using the grammar and then converts them into a planar graph drawing to produce the final shape.

Ask about this paper

Your agent reads all of it.

Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.

Questions to start from

Your agent calls

Luneget_paper_fulltext

Ask in Lune

Free to start. No credit card required.

lune papers fulltext ff8faa0a-527c-462f-986f-410436829ea1

Cited by top-tier papers2

Ask how each one uses it

Builds on1

Related papers

Dusk over the sea between two cliffs drawn in fine vertical lines