1. A computer-implemented method for generating a binary transition file, the method comprising computer-implemented operations for:
generating, by a computer having a processor and a memory, a plurality of animation structures in the binary transition file, the plurality of animation structures defining a sequence of three-dimensional meshes;
generating, by the computer, a header portion in the binary transition file, the header portion defining slides that are applied to the three-dimensional meshes to produce a transition between the slides; and
modifying, by the computer, a presentation program application with the binary transition file, the presentation program application adapted to provide the transition upon the modification.
2. The computer-implemented method of claim 1, wherein generating the plurality of animation structures in the binary transition file comprises computer-implemented operations for:
generating, by the computer, a first animation structure in the binary transition file, the first animation structure defining a first three-dimensional mesh in the sequence of three-dimensional meshes.
3. The computer-implemented method of claim 2, wherein generating the first animation structure in the binary transition file comprises computer-implemented operations for:
generating, by the computer, an index count in the first animation structure, the index count specifying a quantity of indices in the first three-dimensional mesh; and
generating, by the computer, an index array in the first animation structure, the index array comprising a plurality of elements, each of the plurality of elements storing one of the indices.
4. The computer-implemented method of claim 3, wherein generating the first animation structure in the binary transition file further comprises computer-implemented operations for:
generating, by the computer, a vertex count in the first animation structure, the vertex count specifying a quantity of vertices in the first three-dimensional mesh; and
generating, by the computer, a vertex data array in the first in the first animation structure, the vertex data array comprising a plurality of vertex data structures, each of the plurality of vertex data structures storing one of the vertices.
5. The computer-implemented method of claim 4, wherein each of the vertex data structures comprises an x-axis value of the one of the vertices and a y-axis value of the one of the vertices.
6. The computer-implemented method of claim 5, wherein generating the first animation structure in the binary transition file further comprises computer-implemented operations for:
generating, by the computer, a frame count in the first animation structure, the frame count specifying a quantity of animation frames of the transition in which the first three-dimensional mesh is present; and
generating, by the computer, a delta structure array in the first animation structure, the delta structure array comprising a plurality of delta data structures, each of the plurality of delta data structures corresponding to one of the animation frames.
7. The computer-implemented method of claim 6, wherein each of the plurality of delta data structures comprises a minimum value specifying a minimum delta value in a plurality of delta values across the vertices in the one of the animation frames, a range value specifying a range of the plurality of delta values across the vertices in the one of the animation frames, and a deltadata structure array.
8. The computer-implemented method of claim 7, wherein the deltadata structure array comprises a plurality of deltadata data structures, each of the plurality of deltadata data structures corresponding to one of the vertices; and wherein each of the plurality of deltadata data structures comprises an x-axis delta value, a y-axis delta value, and a z-axis delta value.
9. The computer-implemented method of claim 8, wherein each of the plurality of deltadata data structures comprises a single integer that stores the x-axis delta value, the y-axis delta value, and the z-axis delta value.
10. The computer-implemented method of claim 9, wherein generating the first animation structure in the binary transition file further comprises computer-implemented operations for:
generating, by the computer, a slide identifier in the first animation structure, the slide identifier specifying one of the slides that is applied to the first three-dimensional mesh;
generating, by the computer, a set of flags in the first animation structure, the set of flags providing additional information regarding the first three-dimensional mesh; and
generating, by the computer, an ambient lighting value in the first animation structure, the ambient lighting value specifying an amount of ambient lighting applied to the first three-dimensional mesh.
11. The computer-implemented method of claim 10, wherein the set of flags comprises a first flag, a first bit value of the first flag specifying that the first three-dimensional mesh is rendered as a double-sided three-dimensional mesh, a second bit value of the first flag specifying that the first three-dimensional mesh is rendered as a single-sided three-dimensional mesh.
12. The computer-implemented method of claim 1, wherein generating the header portion in the binary transition file comprises computer-implemented operations for:
generating, by the computer, an animation count in the header portion, the animation count specifying a quantity of slides in the transition; and
generating, by the computer, an animations array in the header portion, the animations array comprising a plurality of animation data structures, each of the plurality of animation data structures specifying animation data enabling the presentation program application to render a slide corresponding to the animation data.
13. A computer-readable storage medium having computer-executable instructions stored thereon which, when executed by a computer, cause the computer to:
generate a plurality of animation structures in a binary transition file, the plurality of animation structures defining a sequence of three-dimensional meshes, the plurality of animation structures specifying vertices and indices forming the three-dimensional meshes;
generate a header portion in the binary transition file, the header portion defining slides that are applied to the three-dimensional meshes to produce a transition between the slides; and
modify a presentation program application with the binary transition file, the presentation program application adapted to provide the transition upon the modification.
14. The computer-readable storage medium of claim 13, wherein to generate the plurality of animation structures in the binary transition file, the computer-executable instructions further cause the computer to:
generate a first animation structure in the binary transition file, the first animation structure defining a first three-dimensional mesh in the sequence of three-dimensional meshes.
15. The computer-readable storage medium of claim 14, wherein to generate the first animation structure in the binary transition file, the computer-executable instructions further cause the computer to:
generate an index count in the first animation structure, the index count specifying a quantity of indices in the first three-dimensional mesh;
generate an index array in the first animation structure, the index array comprising a plurality of elements, each of the plurality of elements storing one of the indices;
generate a vertex count in the first animation structure, the vertex count specifying a quantity of vertices in the first three-dimensional mesh; and
generate a vertex data array in the first in the first animation structure, the vertex data array comprising a plurality of vertex data structures, each of the plurality of vertex data structures storing one of the vertices.
16. The computer-readable storage medium of claim 15, wherein each of the vertex data structures comprises an x-axis value of the one of the vertices and a y-axis value of the one of the vertices, without a z-axis value of the one of the vertices.
17. The computer-readable storage medium of claim 16, wherein to generate the first animation structure in the binary transition file, the computer-executable instructions further cause the computer to:
generate a frame count in the first animation structure, the frame count specifying a quantity of animation frames of the transition in which the first three-dimensional mesh is present;
generate a delta structure array in the first animation structure, the delta structure array comprising a plurality of delta data structures, each of the plurality of delta data structures corresponding to one of the animation frames;
wherein each of the plurality of delta data structures comprises a minimum value specifying a minimum delta value in a plurality of delta values across the vertices in the one of the animation frames, a range value specifying a range of the plurality of delta values across the vertices in the one of the animation frames, and a deltadata structure array;
wherein the deltadata structure array comprises a plurality of deltadata data structures, each of the plurality of deltadata data structures corresponding to one of the vertices; and
wherein each of the plurality of deltadata data structures comprises an x-axis delta value, a y-axis delta value, and a z-axis delta value.
18. The computer-readable storage medium of claim 17, wherein to generate the first animation structure in the binary transition file, the computer-executable instructions further cause the computer to:
generate a slide identifier in the first animation structure, the slide identifier specifying one of the slides that is applied to the first three-dimensional mesh;
generate a set of flags in the first animation structure, the set of flags providing additional information regarding the first three-dimensional mesh;
generate an ambient lighting value in the first animation structure, the ambient lighting value specifying an amount of ambient lighting applied to the first three-dimensional mesh; and
wherein the set of flags comprises a first flag, a first bit value of the first flag specifying that the first three-dimensional mesh is rendered as a double-sided three-dimensional mesh, a second bit value of the first flag specifying that the first three-dimensional mesh is rendered as a single-sided three-dimensional mesh.
19. The computer-readable storage medium of claim 17, wherein to generate the header portion in the binary transition file, the computer-executable instructions further cause the computer to:
generate an animation count in the header portion, the animation count specifying a quantity of slides in the transition; and
generate an animations array in the header portion, the animations array comprising a plurality of animation data structures, each of the plurality of animation data structures specifying animation data enabling the presentation program application to render a slide corresponding to the animation data.
20. A computer system, comprising:
a processor;
a memory communicatively coupled to the processor; and
a program module which executes in the processor from the memory and which, when executed by the processor, causes the computer system to:
generate a plurality of animation structures in a binary transition file, the plurality of animation structures defining a sequence of three-dimensional meshes, the plurality of animation structures specifying vertices and indices forming the three-dimensional meshes;
generate a header portion in the binary transition file, the header portion defining slides that are applied to the three-dimensional meshes to produce a transition between the slides, the binary transition file storing delta values of the vertices between frames in the transition; and
modify a presentation program application with the binary transition file, the presentation program application adapted to provide the transition upon the modification.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. A windshield deicer, comprising:
a windshield; and
a substantially transparent heating element disposed with the windshield that generates heat in response to applied power in a magnitude sufficient to melt an interfacial layer of ice on the windshield; and
a controller for limiting duration of the applied power such that a heat diffusion distance into the interfacial layer of ice andor the windshield is less than about a thickness of the ice andor the windshield.
2. The windshield deicer of claim 1, the heating element being selected from visually transparent semiconductor material having an electron gap larger than about 3 eV.
3. The windshield deicer of claim 2, the material comprising one of ZnO, ZnS, and mixtures thereof.
4. The windshield deicer of claim 1, the heating element comprising transparent conductor material.
5. The windshield deicer of claim 4, the material comprising one of indium tin oxide (ITO), tin oxide, metal, and mixtures thereof.
6. The windshield deicer of claim 1, further comprising a protective coating on the heating element.
7. The windshield deicer of claim 1, further comprising a power supply for generating the power.
8. The windshield deicer of claim 7, the power supply comprising a vehicle battery and a step-up converter.
9. The windshield deicer of claim 1, the controller limiting duration of the applied power such that the heat diffusion distance comprises a thickness into the interfacial layer of ice being between about one micron and one millimeter.
10. The windshield deicer of claim 1, the heating element configured into a plurality of heating elements forming a plurality of segmented regions, the controller configured for applying the power to each of the plurality of heating elements to de-ice segments of the windshield.