Method and apparatus for animating transition among dynamic graph series
AssigneeInternational Business Machines Corporation
InventorsWei Jia Cai, Nan Cao, Shixia Liu, Li Tan
Life of this patent
Estimating the term…
Loading patent…
AssigneeInternational Business Machines Corporation
InventorsWei Jia Cai, Nan Cao, Shixia Liu, Li Tan
Estimating the term…
A method and an apparatus for animating transition among a dynamic graph series including a preceding graph and a succeeding graph which are temporally sequentially displayed. The method includes: selecting an unchanged node which is the nearest to a removed node and merging through animation the removed node with the unchanged node, thereby animating removal of the removed node; and selecting an unchanged node which is the nearest to an added node and splitting through animation the added node from the unchanged node, thereby animating addition of the added node. During the animation, the moving distances of the nodes can be shortened, and the crossing of movement paths and the crossing of graph edges can be prevented during the movement of the nodes, thereby visualizing smoothly and clearly transition among dynamic graph series.
A method for animating transitions among graphs in a dynamic graph series having at least one preceding graph and at least one succeeding graph which are temporally sequentially displayed, wherein the graph has at least one unchanged node, removed node, and added node, wherein the method is implemented on a data processing apparatus and comprises the steps of:
An apparatus for animating transitions among a dynamic graph series which includes a preceding graph and a succeeding graph that are temporally sequentially displayed, wherein the graph has at least one unchanged node, removed node, and added node, wherein the apparatus comprises:
A computer readable article of manufacture tangibly embodying computer readable instructions which, when executed by the computer, cause the computer to carry out the steps of a method for animating transitions among graphs in a dynamic graph series having at least one preceding graph and at least one succeeding graph which are temporally sequentially displayed, wherein the graph has at least one unchanged node, removed node, and added node, wherein the method comprises the steps of:
Dependencies are inferred from the claim text.