Vector data compression
First Claim
Patent Images
1. A method of compressing vector data using a history buffer, comprising the steps of:
- normalizing the vector data, wherein the vector data is comprised of one or more primitives representing one or more graphics objects and one or more coordinate values indicating locations for each of the graphics object, and the normalizing step comprises the steps of translating the locations of the graphics objects to an origin and scaling the coordinate values of the graphic objects;
searching the history buffer for a longest matching vector data that matches the normalized vector data; and
when the searching step finds the longest matching vector data, encoding the longest matching vector data found in the history buffer by assigning a substitution code.
1 Assignment
0 Petitions
Accused Products
Abstract
The present invention discloses a method, apparatus, and article of manufacture for compressing vector data. The vector data is normalized to create normalized vector data. A history buffer is searched for a longest matching vector data that matches the normalized vector data. The longest matching vector data is encoded by assigning a substitution code. The vector data is normalized by translating the vector data to an origin and scaling the vector data to a unit square. The substitution code includes a denormalization function, which converts the normalized vector data to vector data.
-
Citations
25 Claims
-
1. A method of compressing vector data using a history buffer, comprising the steps of:
-
normalizing the vector data, wherein the vector data is comprised of one or more primitives representing one or more graphics objects and one or more coordinate values indicating locations for each of the graphics object, and the normalizing step comprises the steps of translating the locations of the graphics objects to an origin and scaling the coordinate values of the graphic objects; searching the history buffer for a longest matching vector data that matches the normalized vector data; and when the searching step finds the longest matching vector data, encoding the longest matching vector data found in the history buffer by assigning a substitution code. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. An apparatus for compressing vector data, comprising:
-
a computer having a memory, a monitor, and a data storage device; means, performed by the computer, for normalizing the vector data, wherein the vector data is comprised of one or more primitives representing one or more graphics object and one or more coordinate values indicating locations for each of the graphics object, and the means for normalizing comprises means for translating the locations of the graphics objects to an origin and for scaling the coordinate values of the graphic objects; means, performed by the computer, for searching in a history buffer for a longest matching vector data that matches the normalized vector data; and means, performed by the computer, for encoding the longest matching vector data found in the history buffer, when the means for searching finds the longest matching vector data, by assigning a substitution code. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
-
17. A program storage device, readable by a computer having a memory and coupled to a data storage device, tangibly embodying one or more programs of instructions executable by the computer to perform method steps for compressing vector data stored in the data storage device, the method comprising the steps of:
-
normalizing the vector data, wherein the vector data is comprised of one or more primitives representing one or more graphics object and one or more coordinate values indicating locations for each of the graphics object, and the normalizing step comprises the steps of translating the locations of the graphics objects to an origin and scaling the coordinate values of the graphic objects; searching a history buffer for a longest matching vector data that matches the normalized vector data; and when the searching step finds the longest matching vector data, encoding the longest matching vector data found in the history buffer by assigning a substitution code. - View Dependent Claims (18, 19, 20, 21, 22, 23, 24, 25)
-
Specification