Back to results
US 9,542,774 B2Granted
Determining a node paththrough a node graph
AssigneeIntel Corporation
InventorsCarl S. Marshall, Adam T. Lake
Life of this patent
Estimating the term…
Abstract
Determining a node path through a node graph includes modifying the node graph in accordance with a predetermined platform performance, performing a path finding process through the node graph to obtain the node path, determining if the platform performance has changed, adjusting the node graph to compensate for a change in the platform performance, and re-performing the path finding process through the adjusted node graph to obtain the node path.
Claims20
A method of determining a node path through a node graph, comprising:
- determining the performance of a platform running an animation sequence that includes the node graph, the node graph having a plurality of polygons;
- adjusting the node graph depending, at least in part, on the performance to change the number of polygons associated with the node graph, and causing the removal of at least one specified node of a node path of a model traversing the node graph;
- determining whether one or more predetermined types of specified node associated with the node path has been removed;
- re-locating the specified node of a predetermined type back onto the adjusted node graph depending on which type of predetermined type the specified node is, wherein each predetermined type indicates a different characteristic of the node graph and relative to other predetermined types;
- and
- performing a path finding process using the re-located specific node.
3 more elements
A method of determining a node path of a 3D model through a node graph, comprising:
- performing, using a processor, a path finding process to determine the node path a 3D model in an animation sequence should take through a 3D mesh with polygons and that defines the node graph, and comprising:
- providing the node path with a start node corresponding to one of the polygons of the 3D mesh and a destination node corresponding to a different polygon of the 3D mesh, wherein the start node and the destination node comprise nodes of the node graph,
- wherein the node graph comprises data that is separate from the 3D mesh, and the method comprising superimposing the node graph over the 3D mesh by using data related to vertices of the 3D mesh and contained by the node graph, and
- wherein when the node graph comprises data associated with the 3D mesh, nodes of the node graph are located at centers of polygons of the 3D mesh or at vertices of the 3D mesh;
- adjusting the node graph to change the number of polygons associated with the node graph, and causing the removal of at least one specified node of a node path of a model traversing the node graph;
- determining whether one or more of the removed specified nodes is a start node or destination node;
- re-locating the specified node if the specified node is the start node or destination node;
- and
- performing a path finding process using the re-located specific node.
6 more elements
Dependencies are inferred from the claim text.