Polygon Rendering Merge Vertex Segmentation

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Handheld wireless communication devices face increased battery drain due to the high computational cost of rendering vector graphics, which demands more efficient decoding methods to reduce power consumption.

Innovation Solution

A method for efficient vector graphics rendering that identifies and processes 'merge vertices' in a polygon, sorting them by y-coordinates to reduce computational effort, and dynamically branches to calculate x-coordinates, thereby minimizing processing load and battery drain.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of energy

If vector graphics are used for multimedia content display, then bandwidth consumption is reduced, but computational cost and battery drain increase

Engineering Contradiction:

Improvebandwidth consumptionVSAvoidbattery drain

Core Design Contradiction:

Loss of energyVSUse of energy by moving object

Solution Approach 1:

The patent segments the polygon rendering process by identifying and separating merge vertices (where edges converge) from regular vertices. This segmentation allows the algorithm to process only relevant vertices and edges for each horizontal span, reducing unnecessary computational operations and lowering battery drain while maintaining efficient vector graphics rendering

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The algorithm performs partial action by calculating x-coordinates only for merge vertices and only when necessary for determining horizontal spans. Rather than processing all vertices uniformly, it applies computational effort selectively to merge vertices, reducing overall computational cost and energy consumption

Inventive Principle:

Principle #16Partial or excessive action

2Productivity

If computational effort is increased to decode vector graphics efficiently, then rendering quality is improved, but battery life is reduced

Engineering Contradiction:

Improverendering efficiencyVSAvoidbattery life

Core Design Contradiction:

ProductivityVSDuration of action of moving object

Solution Approach 1:

The patent applies preliminary action by pre-identifying and sorting merge vertices by their y-coordinates before the main rendering process. This preliminary organization of data allows the subsequent rendering steps to proceed more efficiently without requiring intensive computation during the actual rendering phase, thus preserving battery life while maintaining high rendering productivity

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The algorithm dynamically adapts its processing based on the polygon structure by identifying merge vertices and adjusting the rendering approach accordingly. The method dynamically branches to calculate x-coordinates only when needed, creating a flexible processing pipeline that optimizes computational effort and extends battery life

Inventive Principle:

Principle #15Dynamics

Data Source

PatentUS7283138B2Method, software and apparatus for efficient polygon rendering

Publication Date: 2007.10.16 GOOGLE TECHNOLOGY HOLDINGS LLC

AI summary

One or more special merge vertices (1, 8) each of which is a root of two braches each including a monotonic (in respect to a particular coordinate) series of vertices are selected from an ordered arrangement of vertices (1-10) that defines a polygon (102). The special merge vertices (1, 8) can be sorted (according to the particular coordinate) so that they can be efficiently located when scanning through the polygon. In scanning through the polygon (102) in a process of rendering the polygon (102), the branches are used to demarcate boundaries of the polygon (102).