GRAPHICAL USER INTERFACE GRAPHICS-BASED INTERPOLATED ANIMATION PERFORMANCE

• US 20080222574A1
• Filed: 05/16/2008
• Published: 09/11/2008
• Est. Priority Date: 09/28/2000
• Status: Active Grant

• Current Assignee: Rakuten Group, Inc.
• Original Assignee: AT&T Corporation (AT&T, Inc.)
• Inventors: Coyne, Robert E.
• Granted Patent: US 7,612,778 B2
• Time in Patent Office: Days
• US Class Current: 715/856
• CPC Class Codes: G06T 13/00 Animation
• CPC Class Codes: G06T 2200/24 involving graphical user interfaces [GUIs]

Abstract

An arrangement provides for displaying an object, such as a drawn object, or a database search result, based on a graphical user interface. A first display window is provided for specifying attributes of an object. A second window is provided for spatially inserting anchors for the object, where each anchor specifies a desired characteristic of the object, such as a pose of a face. A third window is provided for the desired object display. The anchors are placed in the second window with the aid of a controlled cursor. Placement of the cursor in the second window also controls the displayed object in the third window, which is developed based on the placement of the cursor in the second window relative to the anchors.

Claims

1. A method of searching, the method comprising:

receiving a query having at least two terms;

presenting in a graphical display a node for each received term;

positioning a cursor in the graphical display;

displaying a list of results from a processing of the query;

repositioning a cursor in the graphical display based on a user input; and

displaying a new list of results in which the repositioning of the cursor causes a change in relative weightings of at least one term associated with its node in a new processing of the query.

2. The method of claim 1, wherein the nodes are arranged in a simulated three dimensional display.

3. The method of claim 1, wherein terms having no semantic association are arranged near one another.

4. The method of claim 1, wherein the closer the cursor is to a respective node, the stronger the relative weighting is for that term in processing the query.

5. The method of claim 1, wherein the change in relative weightings is based on a distance between the cursor and each respective node.

6. The method of claim 1, further comprising:

modifying a position of a respective node in the graphical display based on received user input.

7. The method of claim 1, wherein the existence of a node is manipulated by receiving a chosen factor from a list of factors by the user.

8. The method of claim 1, wherein when the cursor is positioned on a node, the term associated with that node receives a strongest respective weighting in processing the query.

9. A method of searching, the method comprising:

receiving a query;

presenting in a graphical display a plurality of nodes, wherein each node is associated with a search engine;

positioning a cursor in the graphical display;

displaying a list of results from a processing of the query using the search engine associated with the plurality of nodes;

repositioning a cursor in the graphical display; and

displaying a new list of results in which the repositioning of the cursor causes a change in relative weightings of at least one search engine associated with its node in a new processing of the query.

10. The method of claim 9, wherein the nodes are arranged in a simulated three dimensional display.

11. The method of claim 9, wherein the closer the cursor is to a respective node, the stronger the relative weighting is for that search engine in processing the query.

12. The method of claim 9, wherein the change in relative weightings is based on a distance between the cursor and each respective node.

13. The method of claim 9, further comprising:

modifying a position of a respective node in the graphical display based on received user input.

14. The method of claim 9, wherein the existence of a node is manipulated by receiving a chosen factor from a list of factors by the user.

15. The method of claim 9, wherein when the cursor is positioned on a node, the search engine associated with that node receives a strongest respective weighting in processing the query.