Accelerated processing via a physically based rendering engine
One embodiment of a computer-implemented method for compiling a material graph into a set of instructions for execution within an execution unit includes receiving a first material graph having a plurality of nodes, wherein each node included in the plurality of nodes represents a different surface property of a material; parsing the material graph to generate an expression tree that includes one or more expressions for each node included in the plurality of nodes; and generating a set of byte code instructions corresponding to the material graph based on the expression tree, wherein the byte code instructions are executable by a plurality of processing cores included within the execution unit.
1. A computer-implemented method for compiling a material graph into a set of instructions for execution within an execution unit, the method comprising:
receiving a first material graph having a plurality of nodes, wherein each node included in the plurality of nodes represents a different surface property of a material;
parsing the material graph to generate an expression tree that includes one or more expressions for each node included in the plurality of nodes; and
generating a set of byte code instructions corresponding to the material graph based on the expression tree, wherein the byte code instructions are executable by a plurality of processing cores included within the execution unit.
2. The computer-implemented method of claim 1 , wherein the set of byte code instructions, when executed by the plurality of processing cores, generates a color based on the first material graph.
3. The computer-implemented method of claim 1 , wherein the set of byte code instructions, when executed by the plurality of processing cores, generates a direction based on the first material graph.
4. The computer-implemented method of claim 1 , further comprising processing the expression tree to generate a processed expression tree, wherein generating the set of byte code instructions is based on the processed expression tree.
5. The computer-implemented method of claim 4 , wherein processing the expression tree comprises replacing at least one expression of the one or more expressions.
6. The computer-implemented method of claim 4 , wherein processing the expression tree comprises simplifying at least one expression of the one or more expressions.
7. The computer-implemented method of claim 4 , wherein processing the expression tree comprises removing at least one expression of the one or more expressions.
8. The computer-implemented method of claim 4 , wherein processing the expression tree comprises:
identifying a plurality of leaf nodes included in the expression tree;
generating a new node above the plurality of leaf nodes, the new node corresponding to a random selection function;
replacing a root node of the expression tree with the new node; and
for each leaf node included in the plurality of leaf nodes, computing a weight corresponding to the leaf node and assigning the weight to the leaf node.
9. The computer-implemented method of claim 8 further comprising replacing at least a first function corresponding to a first leaf node included in the plurality of leaf nodes with a second function.
10. The computer-implemented method of claim 8 further comprising removing at least one argument associated with a first function corresponding to a first leaf node included in the plurality of leaf nodes.
11. A non-transitory computer-readable medium including instructions that, when executed by a processor, cause the processor to compile a material graph into a set of instructions for execution within an execution unit, by performing the steps of:
receiving a first material graph having a plurality of nodes, wherein each node included in the plurality of nodes represents a different surface property of a material;
parsing the material graph to generate an expression tree that includes one or more expressions for each node included in the plurality of nodes; and
generating a set of byte code instructions corresponding to the material graph based on the expression tree, wherein the byte code instructions are executable by a plurality of processing cores included within the execution unit.
12. The non-transitory computer-readable medium of claim 11 , further comprising processing the expression tree to generate a processed expression tree, wherein generating the set of byte code instructions is based on the processed expression tree.
13. The non-transitory computer-readable medium of claim 12 , wherein processing the expression tree comprises replacing at least one expression of the one or more expressions.
14. The non-transitory computer-readable medium of claim 12 , wherein processing the expression tree comprises simplifying at least one expression of the one or more expressions.
15. The non-transitory computer-readable medium of claim 12 , wherein processing the expression tree comprises removing at least one expression of the one or more expressions.
16. The non-transitory computer-readable medium of claim 12 , wherein processing the expression tree comprises:
identifying a plurality of leaf nodes included in the expression tree;
generating a new node above the plurality of leaf nodes, the new node corresponding to a random selection function;
replacing a root node of the expression tree with the new node; and
for each leaf node included in the plurality of leaf nodes, computing a weight corresponding to the leaf node and assigning the weight to the leaf node.
17. The non-transitory computer-readable medium of claim 11 , wherein generating the set of byte code instructions includes adding one or more stop execution instructions.
18. The non-transitory computer-readable medium of claim 11 , wherein adding the one or more stop execution instructions comprises:
determining that a first function referenced in the expression tree does not correspond to any byte code instructions; and
replacing the first function with a first stop execution instruction.
19. The non-transitory computer-readable medium of claim 18 , further comprising generating a set of one or more program instructions, wherein the set of one or more program instructions, when executed by a processing unit, perform the first function.
20. A system for compiling a material graph into a set of instructions for execution within an execution unit, the system comprising:
a memory storing a set of instructions;
one or more processors that, when executing the set of instructions, perform the steps of:
receiving a first material graph having a plurality of nodes, wherein each node included in the plurality of nodes represents a different surface property of a material;
parsing the material graph to generate an expression tree that includes one or more expressions for each node included in the plurality of nodes; and
generating a set of byte code instructions corresponding to the material graph based on the expression tree, wherein the byte code instructions are executable by a plurality of processing cores included within the execution unit.