US 12,437,478 B2
Automatically generating graph grammars from shapes
Paul Merrell, Redwood City, CA (US)
Filed by Paul Merrell, Redwood City, CA (US)
Filed on Apr. 5, 2023, as Appl. No. 18/295,964.
Claims priority of provisional application 63/327,713, filed on Apr. 5, 2022.
Prior Publication US 2023/0316650 A1, Oct. 5, 2023
Int. Cl. G06T 17/20 (2006.01); G06T 7/50 (2017.01)
CPC G06T 17/20 (2013.01) [G06T 7/50 (2017.01)] 20 Claims
OG exemplary drawing
 
1. A method for deriving a graph grammar consisting of production rules, the method comprising:
identifying an example shape;
splitting the example shape into primitives, each primitive encompassing a vertex of the example shape;
creating a graph hierarchy of graphs, the graphs including:
the primitives,
graphs that are formed by attaching the primitives together, and
graphs that are formed by attaching the primitives to other non-primitive graphs;
for each of one or more graphs in the graph hierarchy, finding a matching set of graphs in the graph hierarchy; and
for each matching set of graphs in the graph hierarchy, defining a production rule of the graph grammar based on the matching set.