Vector Graphics Encoder Random Access via Texel Programs
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional vector graphics technologies face inefficiencies in representing overlapping primitives with different colors, leading to increased storage costs and limited representation capacity, especially when dealing with complex or high-detail areas like serifs on fonts or cities on maps, due to fixed-complexity cells and limitations in handling multiple layers and non-overlapping primitives.
Innovation Solution
The Vector Graphics Encoder employs a coarse image grid of overlapping cells defined by 'texel programs,' where each cell has a locally specialized description of graphics primitives, allowing for variable complexity and efficient random-access rendering through programmable pixel shaders, enabling adaptive complexity and efficient anti-aliasing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If fixed-complexity cells are used to bound outline complexity in each pixel neighborhood, then uniform memory allocation is achieved, but storage cost increases globally because more cells are required and all cells have the same fixed complexity regardless of content
Solution Approach 1:
The patent applies local quality by allowing each cell to have variable complexity based on its local content requirements. Instead of enforcing uniform fixed complexity across all cells, the system dynamically determines the number of primitives per cell based on local geometric complexity, so that cells with simple content use fewer primitives while cells with complex content (such as serif regions or dense map areas) allocate more primitives as needed.
2Manufacturing precision
If conventional vector image schemes with fixed-complexity cells are used, then sharp outlines can be represented, but the number of primitives that can be represented at leaf nodes is limited
Solution Approach 1:
The patent implements dynamics by making the cell complexity adaptive rather than static. The system dynamically adjusts the number of primitives per cell based on local content complexity, allowing the representation capacity to scale with the actual geometric requirements of each region. This dynamic allocation enables leaf nodes to represent a variable number of primitives, from simple shapes to complex overlapping geometries, without being constrained by a fixed upper bound.
3Loss of substance
If a coarse image grid of overlapping cells with variable complexity is used, then storage efficiency improves, but rendering complexity increases due to overlapping primitives
Solution Approach 1:
The patent applies segmentation by dividing the image into overlapping cells, each with its own localized set of primitives. This segmentation allows the rendering system to process each cell independently, evaluating only the primitives relevant to that specific cell rather than traversing all primitives in the entire image. The overlapping nature of cells ensures that each primitive is evaluated only in the cells it actually overlaps, reducing redundant computations.
4Productivity
If vector graphics are rasterized using scanline algorithms, then complete traversal of primitives is performed, but efficient random-access evaluation at any point is not achieved
Solution Approach 1:
The patent segments the vector graphics into cell-based units, where each cell contains a localized subset of primitives. This segmentation enables random-access evaluation by allowing direct access to and evaluation of only the primitives within a specific cell that contains the point of interest, rather than requiring complete traversal of all primitives as in scanline algorithms. The cell structure provides spatial indexing that accelerates point-location queries.
Data Source
AI summary
A “Vector Graphics Encoder” encodes vector graphics in a randomly accessible format. This encoding format enables particular portions of encoded images to be directly accessed, at any desired level of zoom, without processing or otherwise decoding the entire image. This random-access format is based on a coarse image grid of partially overlapping cells wherein each cell is defined by a “texel program.” Unlike fixed-complexity cells used by conventional vector images, each cell defined by a texel program is locally specialized without requiring global constraints on the complexity of each cell. The texel program for each cell is provided as a variable-length string of tokens representing a locally specialized description of one or more of layers of graphics primitives overlapping the cell. Images are then rendered by interpreting the texel programs defining one or more cells.