Parallel Scanline Algorithm for Vector Graphics Rendering

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional methods for rendering vector graphics are inefficient, particularly in handling complex dynamic graphics and anti-aliasing, which results in high computational costs and lower rendering speeds.

Innovation Solution

A method utilizing Bezier curves and rational spline curves for representing vector graphics, employing a parallel scanline algorithm and anti-aliasing techniques to efficiently render contour lines and filled areas, supporting single color, linear gradient, and radial gradient colors, and enabling non-zero and even-odd filling modes.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If conventional rendering methods are used for vector graphics, then rendering accuracy is maintained, but rendering speed decreases and computational cost increases

Engineering Contradiction:
Improverendering speedVSAvoidcomputational time
Core Design Contradiction:
ProductivityVSLoss of time

Solution Approach 1:

The patent divides the vector graphic rendering process into independent parallel segments including contour line segmentation, region division, and pixel processing stages. Each segment can be processed independently on different CPU cores or GPU threads, enabling parallel computation that significantly improves rendering speed while maintaining accuracy.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent implements dynamic rendering strategies that adapt to the complexity of vector graphics. The system dynamically adjusts the level of detail, selects appropriate anti-aliasing methods based on local features, and optimizes computation paths in real-time, allowing fast rendering for simple graphics while maintaining quality for complex regions.

Inventive Principle:
Principle #15Dynamics

2Manufacturing precision

If anti-aliasing algorithms are applied to vector graphic boundaries, then rendering quality improves, but computational cost and rendering time increase

Engineering Contradiction:
Improverendering qualityVSAvoidcomputational complexity
Core Design Contradiction:
Manufacturing precisionVSDevice complexity

Solution Approach 1:

The patent applies anti-aliasing techniques selectively based on local characteristics of vector graphics. High-quality anti-aliasing is applied only to critical boundary regions where it is most needed, while simpler methods or no anti-aliasing is used in less critical areas, thereby improving overall rendering quality without proportionally increasing computational complexity.

Inventive Principle:
Principle #3Local quality

Solution Approach 2:

The patent changes the parameters of anti-aliasing algorithms to optimize the balance between quality and performance. By adjusting sampling rates, filter kernels, and application thresholds based on graphic complexity and display requirements, the system achieves acceptable anti-aliasing quality with reduced computational overhead.

Inventive Principle:
Principle #35Parameter changes

3Productivity

If pre-processing steps are performed to construct acceleration data structures, then rendering efficiency improves, but pre-processing time increases

Engineering Contradiction:
Improverendering efficiencyVSAvoidpre-processing time
Core Design Contradiction:
ProductivityVSLoss of time

Solution Approach 1:

The patent performs essential preprocessing actions in advance including contour line extraction, region identification, and hierarchical structure construction. These preliminary actions organize the vector graphic data into optimized formats that enable faster rendering during actual display, particularly for complex graphics that require multiple rendering passes or levels of detail.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS10395401B2Method for efficient parallel visualizing vector graphic
Publication Date: 2019.08.27 ZHEJIANG UNIV
  • US10395401B2 patent drawing
  • US10395401B2 patent drawing

AI summary

A method for efficiently visualizing parallel vector data rapidly renders high-quality complex vector graphics. The present invention provides a scanline algorithm for calculating and rendering on contour lines, which parallel-rasterizing on the contour lines. The algorithm firstly rasterizes the contour lines into segments corresponding to output image pixels. On each segment, color values are analytically calculated, or approximately obtained by a sampling algorithm. Contour rasterizing is efficiently completed in parallel. By analytical calculation or 32-bit sampling, high quality results are obtained. The present invention adapts parallel prefixes and algorithms in a scanline direction to obtain covering information for each pixel and generate filled areas. Finally, the contour line segments and the filled areas of the vector graphics are rendered in the output image. The present invention is entirely based on parallel many-core computing devices for real-time high-quality vector graphic rendering with hardware acceleration.