Abstract: A method, system, and computer-readable storage medium are disclosed for minimizing tessellation of surfaces. A first plurality of polygons may be generated, wherein the first plurality of polygons are adjacent to a plurality of exterior curves of a surface. Each of the first plurality of polygons comprises at least one outside edge approximating a portion of one of the exterior curves within a first flatness tolerance. A second plurality of polygons may be generated, wherein the second plurality of polygons are on the interior of the surface. Each of the second plurality of polygons comprises a plurality of inside edges approximating portions of interior curves of the surface within a second flatness tolerance. The first flatness tolerance may be smaller than the second flatness tolerance.

Abstract: A method, system, and computer-readable storage medium are disclosed for minimizing tessellation of surfaces. A first plurality of polygons may be generated, wherein the first plurality of polygons are adjacent to a plurality of boundaries of a surface. Each of the first plurality of polygons comprises at least one outside edge approximating a straight line within a first flatness tolerance. A second plurality of polygons may be generated, wherein the second plurality of polygons are on the interior of the surface. Each of the second plurality of polygons comprises a plurality of inside edges approximating the straight line within a second flatness tolerance. The first flatness tolerance may be smaller than the second flatness tolerance.

Abstract: Methods and apparatus for compressing and decompressing multiple data sets (e.g., multiple color planes in a color image) in which interdependencies between the data sets, as well as spacial correlation within each data set, are used to create a plurality of compressed output data sets wherein one of the compressed output data sets includes data relating to all of the original uncompressed data sets and wherein each of the remaining output data sets includes data relating only to a particular one of the original uncompressed data sets. Advantageously, the disclosed techniques provide compression ratios approaching those of known vector compression algorithms while simultaneously providing decompression memory usage characteristics analogous to those found in planar compression systems. Thus, exemplary embodiments of the invention simultaneously provide relatively low peak and average memory requirements, corresponding to relatively low memory cost and relatively high data throughput, respectively.