Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
1. A computer-implemented method for rendering three-dimensional images using a level graph, the method comprising: accessing the level graph, the level graph comprising a first node, a second node, a third node, and a target node, wherein: the second node, third node, and target node are descendants of the first node, the target node or an ancestor of the target node is a direct descendant of both the second node and the third node, and the first node comprises a first scene description data, the second node comprises a first variation data, the third node comprises a second variation data, and the target node comprises a third variation data; receiving a selection of the target node for computation; determining ancestors of the target node, wherein the ancestors of the target node comprises the first node, the second node, and the third node; determining a linearization of the ancestors of the target node, the linearization comprising an order of the ancestors of the target node; initializing a scene description using the first scene description data of the first node; applying the variation data of the second node and the third node, based on the order determined by the linearization, to the scene description to produce an updated scene description; applying the third variation of the target node to the updated scene description to produce a final scene description; and rendering an image based on the final scene description.
A computer method renders 3D images using a level graph. The graph contains a first node (containing initial scene data), second and third nodes (containing variations), and a target node, where all are descendants of the first node, and the target or its ancestor descends from both the second and third. The method selects a target node, determines its ancestors (including the first, second, and third nodes), and linearizes the ancestors to define their processing order. It initializes a scene description using the first node's scene data, then applies the second and third node variations in the determined order to update the scene. Finally, it applies the target node's variation to produce a final scene description and renders an image from it.
2. The computer-implemented method of claim 1 , wherein the first node is a base node that is a root node.
The 3D image rendering method using a level graph, as described in the previous claim, wherein the first node, containing the initial scene description, is a base or root node in the level graph. This means the scene rendering starts from a foundational scene description, onto which the descendant nodes introduce modifications.
3. The computer-implemented method of claim 1 , wherein initializing the scene description using the scene description data of the first node is based on the linearization.
In the 3D image rendering method using a level graph, as described previously, initializing the scene description using the first node's scene description data considers the linearization order of ancestor nodes. This implies the initial scene may be set up differently depending on how the variations from other ancestor nodes will eventually be applied, allowing for context-aware initialization.
4. The computer-implemented method of claim 1 , wherein the second node further comprises a second scene description data, and wherein the second scene description data is applied to the scene description to produce the updated scene description.
In the 3D image rendering method using a level graph, as described previously, the second node contains both a variation and scene description data. The second node's scene description data is applied to update the scene before its variation is applied. This allows for a node to contain both full scene information and incremental modifications, which are applied in sequence.
5. The computer-implemented method of claim 1 , wherein determining the linearization of the ancestors of the target node comprises determining the linearization of the ancestors of the target node based on a C3 superclass linearization algorithm.
In the 3D image rendering method using a level graph, as described previously, the linearization of ancestor nodes (determining the order in which their variations are applied) is performed using the C3 superclass linearization algorithm. This algorithm provides a consistent and predictable order, particularly when the level graph has complex inheritance structures to avoid ambiguity when combining scene variations.
6. The computer-implemented method of claim 1 , wherein: the first node comprises a first tag and the second node comprises a second tag; and determining the linearization of the ancestors of the target node comprises ordering the first node and the second node based on the first tag and the second tag.
In the 3D image rendering method using a level graph, as described previously, the first and second nodes contain first and second tags. The linearization of the ancestor nodes is determined by ordering the first and second nodes based on these tags. This allows using tag values to explicitly control the order in which scene variations are applied, enabling fine-grained control over the final rendered image.
7. A non-transitory computer-readable storage medium comprising computer-executable instructions for rendering three-dimensional images using a level graph, the computer-executable instructions comprising instructions for: accessing the level graph, the level graph comprising a first node, a second node, a third node, and a target node, wherein: the second node, third node, and target node are descendants of the first node, the target node or an ancestor of the target node is a direct descendant of both the second node and the third node, and the first node comprises a first scene description data, the second node comprises a first variation data, the third node comprises a second variation data, and the target node comprises a third variation data; receiving a selection of the target node for computation; determining ancestors of the target node, wherein the ancestors of the target node comprises the first node, the second node, and the third node; determining a linearization of the ancestors of the target node, the linearization comprising an order of the ancestors of the target node; initializing a scene description using the first scene description data of the first node; applying the variation data of the second node and the third node, based on the order determined by the linearization, to the scene description to produce an updated scene description; applying the third variation of the target node to the updated scene description to produce a final scene description; and rendering an image based on the final scene description.
A non-transitory computer-readable medium stores instructions for rendering 3D images using a level graph. The graph contains a first node (containing initial scene data), second and third nodes (containing variations), and a target node, where all are descendants of the first node, and the target or its ancestor descends from both the second and third. The instructions select a target node, determine its ancestors (including the first, second, and third nodes), and linearize the ancestors to define their processing order. It initializes a scene description using the first node's scene data, then applies the second and third node variations in the determined order to update the scene. Finally, it applies the target node's variation to produce a final scene description and renders an image from it.
8. The non-transitory computer-readable storage medium of claim 7 , wherein the first node is a base node that is a root node.
The computer-readable medium for 3D image rendering using a level graph, as described in the previous claim, wherein the first node, containing the initial scene description, is a base or root node in the level graph. This means the scene rendering starts from a foundational scene description, onto which the descendant nodes introduce modifications.
9. The non-transitory computer-readable storage medium of claim 7 , wherein initializing the scene description using the scene description data of the first node is based on the linearization.
The computer-readable medium for 3D image rendering using a level graph, as described previously, wherein initializing the scene description using the first node's scene description data considers the linearization order of ancestor nodes. This implies the initial scene may be set up differently depending on how the variations from other ancestor nodes will eventually be applied, allowing for context-aware initialization.
10. The non-transitory computer-readable storage medium of claim 7 , wherein the second node further comprises a second scene description data, and wherein the second scene description data is applied to the scene description to produce the updated scene description.
The computer-readable medium for 3D image rendering using a level graph, as described previously, wherein the second node contains both a variation and scene description data. The second node's scene description data is applied to update the scene before its variation is applied. This allows for a node to contain both full scene information and incremental modifications, which are applied in sequence.
11. The non-transitory computer-readable storage medium of claim 7 , wherein determining the linearization of the ancestors of the target node comprises determining the linearization of the ancestors of the target node based on a C3 superclass linearization algorithm.
The computer-readable medium for 3D image rendering using a level graph, as described previously, wherein the linearization of ancestor nodes (determining the order in which their variations are applied) is performed using the C3 superclass linearization algorithm. This algorithm provides a consistent and predictable order, particularly when the level graph has complex inheritance structures to avoid ambiguity when combining scene variations.
12. The non-transitory computer-readable storage medium of claim 7 , wherein: the first node comprises a first tag and the second node comprises a second tag; and determining the linearization of the ancestors of the target node comprises ordering the first node and the second node based on the first tag and the second tag.
The computer-readable medium for 3D image rendering using a level graph, as described previously, wherein the first and second nodes contain first and second tags. The linearization of the ancestor nodes is determined by ordering the first and second nodes based on these tags. This allows using tag values to explicitly control the order in which scene variations are applied, enabling fine-grained control over the final rendered image.
13. An apparatus for rendering three-dimensional images using a level graph, the apparatus comprising: a memory configured to store the level graph; and one or more computer processors configured to: access the level graph, the level graph comprising a first node, a second node, a third node, and a target node, wherein: the second node, third node, and target node are descendants of the first node, the target node or an ancestor of the target node is a direct descendant of both the second node and the third node, and the first node comprises a first scene description data, the second node comprises a first variation data, the third node comprises a second variation data, and the target node comprises a third variation data; receive a selection of the target node for computation; determine ancestors of the target node, wherein the ancestors of the target node comprises the first node, the second node, and the third node; determine a linearization of the ancestors of the target node, the linearization comprising an order of the ancestors of the target node; initialize a scene description using the first scene description data of the first node; apply the variation data of the second node and the third node, based on the order determined by the linearization, to the scene description to produce an updated scene description; apply the third variation of the target node to the updated scene description to produce a final scene description; and render an image based on the final scene description.
An apparatus renders 3D images using a level graph. It comprises memory storing the level graph and one or more processors. The level graph contains a first node (containing initial scene data), second and third nodes (containing variations), and a target node, where all are descendants of the first node, and the target or its ancestor descends from both the second and third. The processors select a target node, determine its ancestors (including the first, second, and third nodes), and linearize the ancestors to define their processing order. They initialize a scene description using the first node's scene data, then apply the second and third node variations in the determined order to update the scene. Finally, they apply the target node's variation to produce a final scene description and render an image from it.
14. The apparatus of claim 13 , wherein the first node is a base node that is a root node.
The 3D image rendering apparatus using a level graph, as described in the previous claim, wherein the first node, containing the initial scene description, is a base or root node in the level graph. This means the scene rendering starts from a foundational scene description, onto which the descendant nodes introduce modifications.
15. The apparatus of claim 13 , wherein initializing the scene description using the scene description data of the first node is based on the linearization.
The 3D image rendering apparatus using a level graph, as described previously, wherein initializing the scene description using the first node's scene description data considers the linearization order of ancestor nodes. This implies the initial scene may be set up differently depending on how the variations from other ancestor nodes will eventually be applied, allowing for context-aware initialization.
16. The apparatus of claim 13 , wherein the second node further comprises a second scene description data, and wherein the second scene description data is applied to the scene description to produce the updated scene description.
The 3D image rendering apparatus using a level graph, as described previously, wherein the second node contains both a variation and scene description data. The second node's scene description data is applied to update the scene before its variation is applied. This allows for a node to contain both full scene information and incremental modifications, which are applied in sequence.
17. The apparatus of claim 13 , wherein determining the linearization of the ancestors of the target node comprises determining the linearization of the ancestors of the target node based on a C3 superclass linearization algorithm.
The 3D image rendering apparatus using a level graph, as described previously, wherein the linearization of ancestor nodes (determining the order in which their variations are applied) is performed using the C3 superclass linearization algorithm. This algorithm provides a consistent and predictable order, particularly when the level graph has complex inheritance structures to avoid ambiguity when combining scene variations.
18. The apparatus of claim 13 , wherein: the first node comprises a first tag and the second node comprises a second tag; and determining the linearization of the ancestors of the target node comprises ordering the first node and the second node based on the first tag and the second tag.
The 3D image rendering apparatus using a level graph, as described previously, wherein the first and second nodes contain first and second tags. The linearization of the ancestor nodes is determined by ordering the first and second nodes based on these tags. This allows using tag values to explicitly control the order in which scene variations are applied, enabling fine-grained control over the final rendered image.
Unknown
November 7, 2017
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.