Abstract: A method allowing for quick manipulation of weight values associated with points on a polygonal mesh that is to be deformed. A point on the polygonal mesh may be selected by the user. Then, a solution space of possible positions for the selected point may be calculated by solving a deformation model for a range of weight values. A graphical representation of the solution space may be provided, such as a locus of possible positions for the selected point, where each point on the locus corresponds to a particular weight value. Manipulation of these weight values, and hence, the deformation of the polygonal mesh, may be achieved simply by selecting a position on the locus. The mesh may be updated to reflect the weight corresponding to the selected position.

Abstract: A user interface presents views of entities and their attributes relative to any subset of associated parameters. A view may present views of entities as a function of one or more parameters. A selection of a subset of entities in one view with respect to parameters may be presented in another view with respect to different parameters. Entities may be manipulated in any supplemental view to change their values or their parameter associations. A view may present components and parameters associated with layers or any subset of layers and/or after layer compositing. A view can include resolved values of components and their attributes. A supplemental view may include visual indicators to indicate the layer or other parameter defining its resolved value. Hierarchical relationships may be presented in views, with ancestor entities expanded within a view to show its descendent entities or collapsed to hide its descendent entities.

Abstract: Empty elements or positions in an arrangement of data are hidden or revealed to present an overview of the relationships between empty and non-empty elements. Empty elements may be revealed at fractional increments of the interval between the two items. Additional empty elements may be revealed at smaller fractional increments of the intervals. Empty elements may be revealed at fixed increments within the interval between two items, with additional empty elements revealed at further multiples of this increment. Hierarchical arrangements of data may be unfolded or expanded to reveal additional empty or non-empty elements at further hierarchy levels. Similarly, nodes of arbitrary graphs that are empty, associated with a specified hierarchy level, and/or satisfy any other criteria may be automatically hidden and grouped with visible items. Hidden data may be revealed based on hierarchy level or a relative position with respect to one, two, or more visible items.

Abstract: A method for specifying an animatronics unit includes receiving a force-based software model for the animatronics unit, receiving a kinematics-based software model for the animatronics unit, receiving animation data for animating the kinematics-based software model, wherein the animation data comprises artistically determined motions for the kinematics-based software model by a user, determining a plurality of driving signals in response to the animation data, animating the force-based software model of the animatronics unit in response to the plurality of driving signals, displaying animation of the force-based software model determined in response to the plurality of driving signals, and determining a specification for construction of the animatronics unit in response to animation of the force-based software model.

Abstract: Multiple time scales enable animations over multiple shots. Time-dependent data is specified with reference to time references. Data expressed in different time references may be combined to form animations, shots, and sequences of shots. Time transformations specifying mappings between time references are used to combine data expressed in different time references. Data can be viewed in arbitrary time references. Editing data specifying a sequence of shots may be used as a time reference for viewing data expressed in other time references. Data expressed in one time reference may be rearranged according to another time reference to indicate time reference relationships. Data authored in one time reference may be viewed and modified in another time reference. Modifications are converted from the viewing time reference to the data's original time reference for updating data. Time-dependent data may be expressed in layer data structures. Layer relationships may include time transformations.

Abstract: A method allowing for quick manipulation of weight values associated with points on a polygonal mesh that is to be deformed. A point on the polygonal mesh may be selected by the user. Then, a solution space of possible positions for the selected point may be calculated by solving a deformation model for a range of weight values. A graphical representation of the solution space may be provided, such as a locus of possible positions for the selected point, where each point on the locus corresponds to a particular weight value. Manipulation of these weight values, and hence, the deformation of the polygonal mesh, may be achieved simply by selecting a position on the locus. The mesh may be updated to reflect the weight corresponding to the selected position.

Abstract: Animation software enables the creation and manipulation of animation in terms of relationships between poses, as opposed to discrete values of computer graphics variable knots. Poses are automatically associated with animation structures that define object pose or poses over a time interval, rather than at a single discrete time. Animation structures may define and manipulate animation data defined over time intervals as a unit, as opposed to a set of unrelated computer graphics variable knots. Animation structures may be used to block out the general form, timing, and rhythm of animations. Optional transition animation structures, pose anticipations, and pose reactions may be automatically or manually defined between adjacent pose hold durations. General parameters of an animation structure may be applied to create or modify the animation data associated with the animation structure. Operations on animation structures can be applied to all of the animation data included in these animation structures.

Abstract: To assist users in identifying the contributions of specific computer graphics variable or animation variable knots to the timing, rhythm, and expression of complicated animations, an animation software interface includes a snapsheet mode for visualizing and authored poses of objects. The snapsheet mode presents a series of rendered still images corresponding with the authored poses of one or more selected entities. The snapsheet mode may use one or more computer graphics variables, one or more objects, or arbitrary frames or shot time values as selected entities. The snapsheet mode associates each still image with a portion of the shot time of the overall animation corresponding with the selected entity's influence in the animation. Users may modify animation data via the snapsheet mode using each image may act as a proxy for manipulating associated authored values of one or more computer graphics variables.

Abstract: An application user interface includes multiple editors, each presenting a data view and controls for operating on data. The application user interface includes a windowed mode and a full-screen mode. The windowed mode displays multiple editors simultaneously, such as in separate windows or panes. The full-screen mode displays a primary editor that substantially covers the application display area. The full-screen mode displays the secondary editors as drawer user interface elements arranged along the edges of the application display area. Secondary editors are displayed and accessed as needed via these drawer user interface elements. The relative arrangement of editors is preserved when switching between windowed mode and full-screen mode.

Abstract: Components are presented to users based on the components' assigned task memberships. The tasks represents the different activities performed by users within a digital production pipeline. Each stage of the digital production pipeline may be associated with a task. Additional user-defined tasks may be defined as needed to further distinguish components. Attributes of components are associated with one or more tasks when the component is authored. Task memberships may be inherited from parent components or overridden. A user interface includes a task selection menu to receive a selection of one or more tasks from the user. The task selection is used to filter components, so that the user interface presents only relevant information to users. Component attribute values and task associations can be expressed using layer data structures. Task restrictions of layers allow layers to only specify values of components that match the task associations of the layer.

Abstract: A unified mechanism of scene description includes layering and cross-referencing relationships. The scene description specifies components using one or more layers. A layer includes an opinion of value for one or more attributes of one or more components. A layer can be sparsely populated with opinions of attribute values for only portions of components' attributes. Layers express opinions of value for an attribute using the semantic structure associated with the attribute. The scene description organizes layers in a layer hierarchy, which determines a layer stacking order. The layer stacking order specifies the compositing of opinions of attribute values to determine the complete authored state of the component. The layer stacking order enables attributes of components to be selectively overridden without disturbing other attribute values. Cross-referencing relationships enable encapsulation and reuse of components. Cross-referencing relationships can encapsulate components defined by one or more layers.

Abstract: The components of a computer graphics scene can be organized using multiple independent graphs. Each component can include graph relationship attributes specifying its location in one or more graphs. Graph can be utilized for any purpose within the digital production pipeline. A component can include any number of graph relationship attributes. The number and type of graph relationship attributes can be different for each component. Software tools can access one or more graphs to determine structural or functional relationships between components. Software tools can enforce policies for a graph independent of other graphs. Software tools can optimize the components of a graph independent of other graphs. A graph relationship attribute of a component can include optional parameter data to specify properties of the relationship between two or more components. Layer data structures including opinions of value can specify graph relationships.

Abstract: A unified mechanism of scene description includes layering and cross-referencing relationships. The scene description specifies components using one or more layers. A layer includes an opinion of value for one or more attributes of one or more components. A layer can be sparsely populated with opinions of attribute values for only portions of components' attributes. Layers express opinions of value for an attribute using the semantic structure associated with the attribute. The scene description organizes layers in a layer hierarchy, which determines a layer stacking order. The layer stacking order specifies the compositing of opinions of attribute values to determine the complete authored state of the component. The layer stacking order enables attributes of components to be selectively overridden without disturbing other attribute values. Cross-referencing relationships enable encapsulation and reuse of components. Cross-referencing relationships can encapsulate components defined by one or more layers.