Generating animation based on first scene and second scene

1. A non-transitory computer-readable storage medium comprising instructions stored thereon that, when executed by at least one processor, are configured to cause a computing system to:

based on a first scene and a second scene, generate candidate animations that include respective transitions of a first graphical element transitioning from a first location to a second location and respective transitions of a second graphical element transitioning from a third location to a fourth location, the respective transitions being selected from multiple predetermined movements and being based on an animation time;

determine respective scores for the candidate animations, the respective score for a candidate animation being based on the respective transition of the first graphical element with respect to the respective transition of the second graphical element for the candidate animation;

select a chosen animation from the candidate animations based on the respective scores; and

present the chosen animation.

2. The non-transitory computer-readable storage medium of claim 1 , wherein the generation of the candidate animations includes:

generating a first candidate animation based on the first scene and the second scene by:

selecting, from the multiple predetermined movements, a first transition for the first graphical element from the first location to the second location, and

selecting, from the multiple predetermined movements, a second transition for the second graphical element from the third location to the fourth location; and

generating a second candidate animation based on the first scene and the second scene by:

selecting, from the multiple predetermined movements, a third transition for the first graphical element from the first location to the second location, the third transition being different than the first transition, and

selecting, from the multiple predetermined movements, a fourth transition for the second graphical element from the third location to the fourth location, the fourth transition being different than the second transition.

3. The non-transitory computer-readable storage medium of claim 2 , wherein the determination of the respective scores includes:

determining a first score for the first candidate animation based on the first transition for the first graphical element with respect to the second transition for the second graphical element; and

determining a second score for the second candidate animation based on the third transition for the first graphical element with respect to the fourth transition for the second graphical element.

4. The non-transitory computer-readable storage medium of claim 1 , wherein the respective transitions of the first graphical element in the candidate animations are generated before the respective transitions of the second graphical element based on a priority of the first graphical element being higher than a priority of the second graphical element.

5. The non-transitory computer-readable storage medium of claim 4 , wherein the instructions are further configured to cause the computing system to determine that the priority of the first graphical element is higher than the priority of the second graphical element based on a chronological order in which the first graphical element and the second graphical element were added to the first scene.

6. The non-transitory computer-readable storage medium of claim 4 , wherein the priority of the first graphical element and the priority of the second graphical element are explicitly received priorities.

7. The non-transitory computer-readable storage medium of claim 1 , wherein the multiple predetermined movements include movement along a straight line.

8. The non-transitory computer-readable storage medium of claim 1 , wherein the multiple predetermined movements include movement along an arc.

9. The non-transitory computer-readable storage medium of claim 1 , wherein the multiple predetermined movements include movement along a curved path.

10. The non-transitory computer-readable storage medium of claim 1 , wherein the multiple predetermined movements include fading out of and into the first scene and the second scene, respectively, at different locations.

11. A method comprising:

based on a first scene and a second scene, generating candidate animations that include respective transitions of a first graphical element transitioning from a first location to a second location and respective transitions of a second graphical element transitioning from a third location to a fourth location, the respective transitions being selected from multiple predetermined movements and being based on an animation time;

determining respective scores for the candidate animations, the respective score for a candidate animation being based on the respective transition of the first graphical element with respect to the respective transition of the second graphical element for the candidate animation;

selecting a chosen animation from the candidate animations based on the respective scores; and

presenting the chosen animation.

12. The method of claim 11 , wherein the generation of the candidate animations includes:

generating a first candidate animation based on the first scene and the second scene by:

selecting, from the multiple predetermined movements, a first transition for the first graphical element from the first location to the second location, and

selecting, from the multiple predetermined movements, a second transition for the second graphical element from the third location to the fourth location; and

generating a second candidate animation based on the first scene and the second scene by:

selecting, from the multiple predetermined movements, a third transition for the first graphical element from the first location to the second location, the third transition being different than the first transition, and

selecting, from the multiple predetermined movements, a fourth transition for the second graphical element from the third location to the fourth location, the fourth transition being different than the second transition.

13. The method of claim 12 , wherein the determination of the respective scores includes:

determining a first score for the first candidate animation based on the first transition for the first graphical element with respect to the second transition for the second graphical element; and

determining a second score for the second candidate animation based on the third transition for the first graphical element with respect to the fourth transition for the second graphical element.

14. The method of claim 11 , wherein the respective transitions of the first graphical element in the candidate animations are generated before the respective transitions of the second graphical element based on a priority of the first graphical element being higher than a priority of the second graphical element.

15. The method of claim 14 , further comprising determining that the priority of the first graphical element is higher than the priority of the second graphical element based on a chronological order in which the first graphical element and the second graphical element were added to the first scene.

16. The method of claim 14 , wherein the priority of the first graphical element and the priority of the second graphical element are explicitly received priorities.

17. A computing system comprising:

at least one processor; and

a non-transitory computer-readable storage medium comprising instructions stored thereon that, when executed by the at least one processor, are configured to cause the computing system to:

based on a first scene and a second scene, generate candidate animations that include respective transitions of a first graphical element transitioning from a first location to a second location and respective transitions of a second graphical element transitioning from a third location to a fourth location, the respective transitions being selected from multiple predetermined movements and being based on an animation time;

determine respective scores for the candidate animations, the respective score for a candidate animation being based on the respective transition of the first graphical element with respect to the respective transition of the second graphical element for the candidate animation;

select a chosen animation from the candidate animations based on the respective scores; and

present the chosen animation.

18. The computing system of claim 17 , wherein the generation of the candidate animations includes:

generating a first candidate animation based on the first scene and the second scene by:

selecting, from the multiple predetermined movements, a first transition for the first graphical element from the first location to the second location, and

selecting, from the multiple predetermined movements, a second transition for the second graphical element from the third location to the fourth location; and

generating a second candidate animation based on the first scene and the second scene by:

selecting, from the multiple predetermined movements, a third transition for the first graphical element from the first location to the second location, the third transition being different than the first transition, and

selecting, from the multiple predetermined movements, a fourth transition for the second graphical element from the third location to the fourth location, the fourth transition being different than the second transition.

19. The computing system of claim 18 , wherein the determination of the respective scores includes:

determining a first score for the first candidate animation based on the first transition for the first graphical element with respect to the second transition for the second graphical element; and

determining a second score for the second candidate animation based on the third transition for the first graphical element with respect to the fourth transition for the second graphical element.

20. The computing system of claim 17 , wherein the respective transitions of the first graphical element in the candidate animations are generated before the respective transitions of the second graphical element based on a priority of the first graphical element being higher than a priority of the second graphical element.