Abstract: A system and method for simulating motion in an interactive computer application wherein images of a scene are used to render views of the scene from particular viewpoints. The method and system includes registering a first image and a second image using a transformation that overlays common features of both the first and the second image. After the two images are registered, at least one intermediate image is generated by applying a first interpolated transformation to the first image and a second interpolated transformation to the second image. The first image, the intermediate image, and the second image are then sequentially rendered to simulate motion through the scene.

Abstract: A data structure is disclosed in which stored objects in a computer system can be extended. The data structure contains a header containing encapsulation information related to the stored object, data describing the essential elements of the object, and at least one subobject extending the description of the object. Header information includes metafile identification, version and revision numbers, endian code information as to the ordering significance of the stored data and a table of contents. Encapsulation information describes the size and type of the individual objects. Essential elements and extensibility data permit additional attribute information to be used and shared among applications which utilize the object.

Abstract: The present invention is a method for performing a parallel interpolation between corresponding pixel characteristics within a packed foreground pixel data word and a packed background pixel data word. A blending factor is used to indicate the extent to which the pixel characteristics are scaled, where the scaling is related to a power of two. The pixel characteristics within each packed data word are scaled simultaneously.

Abstract: A method and system are disclosed for efficiently translating data from one known data sequencing arrangement to an alternative sequencing arrangement. The method consists of the steps of generating a source sequence signal which identifies the ordering of units within the source sequence, generating a destination sequence signal which identifies the ordering of units within the destination sequence, and combining the source signal and destination signal to produce a permutation signal which defines the relationship between the source sequence and the destination sequence. Once the permutation signal has been defined, this permutation signal is applied to the source sequence to allow the reordering of the source sequence into the desired destination sequence. A reordering circuit is used to rearrange the source sequence units into the desired destination sequence units utilizing the permutation signal generated in the present invention.

Abstract: A method and system are disclosed for efficiently translating data from one known data sequencing arrangement to an alternative sequencing arrangement. The method consists of the steps of generating a source sequence signal which identifies the ordering of units within the source sequence, generating a destination sequence signal which identifies the ordering of units within the destination sequence, and combining the source signal and destination signal to produce a permutation signal which defines the relationship between the source sequence and the destination sequence. Once the permutation signal has been defined, this permutation signal is applied to the source sequence to allow the reordering of the source sequence into the desired destination sequence. A reordering circuit is used to rearrange the source sequence units into the desired destination sequence units utilizing the permutation signal generated in the present invention.

Abstract: An apparatus for combining a foreground pixel signal and a background pixel signal according to a blending factor signal to generate a composite pixel signal comprises first, second, and third registers; a signal selecting multiplier; and at least one adder. The first, second, and third registers store the foreground pixel signal, the background pixel signal, and the blending factor signal, respectively. The signal selecting multiplier uses the signal within the third register to selectively shift and add the signals within the first and second registers, resulting in a compound pixel signal. Each adder is used to combine the compound pixel signal with a correction signal, producing an approximation signal. A subset of bits within the approximation signal correspond to the composite pixel signal.