Conservative Rasterization Hardware for Degenerate Primitive Tiling

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing graphics processing systems face inefficiencies in handling conservative rasterization, particularly due to increased processing demands and aliasing issues when generating a large number of primitives, which can be exacerbated by the conversion of floating-point to fixed-point vertex coordinates, leading to quantization errors and increased hardware requirements.

Innovation Solution

Implementing a graphics pipeline that converts vertex coordinates to fixed-point format, identifies degenerate primitives, and uses conservative bounding boxes and modified tiling algorithms to optimize rasterization, including techniques like flat interpolation and depth bias to improve efficiency and reduce false negatives.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Manufacturing precision

If a large number of primitives are generated to improve surface approximation accuracy, then manufacturing precision is improved, but device complexity and processing effort increase

Engineering Contradiction:
Improvesurface approximation accuracyVSAvoidprocessing effort
Core Design Contradiction:
Manufacturing precisionVSDevice complexity

Solution Approach 1:

The patent extracts and handles degenerate primitives separately from regular primitives. By identifying primitives that become degenerate after floating-point to fixed-point conversion and processing them through a specialized path (using conservative bounding boxes and flat interpolation), the system avoids the complex processing required for regular primitives while maintaining rendering accuracy.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent changes the representation parameters of degenerate primitives by converting them to a simplified form. Degenerate primitives are identified by checking if their area is zero after coordinate conversion, and then processed with simplified attributes (conservative bounding boxes, flat interpolation) rather than full primitive attributes, reducing processing complexity.

Inventive Principle:
Principle #35Parameter changes

2Device complexity

If floating-point to fixed-point conversion is used to reduce hardware requirements, then device complexity is reduced, but quantization errors increase

Engineering Contradiction:
Improvehardware requirementsVSAvoidcoordinate precision
Core Design Contradiction:
Device complexityVSMeasurement precision

Solution Approach 1:

The patent applies beforehand cushioning by using conservative bounding boxes that extend beyond the actual primitive boundaries. This pre-compensation for quantization errors ensures that even if coordinate precision is lost during floating-point to fixed-point conversion, the rendered output still covers the entire visible portion of the primitive, preventing visual artifacts.

Inventive Principle:
Principle #11Beforehand cushioning (Prior cushioning)

Solution Approach 2:

The patent converts the harmful effect of quantization errors into a beneficial filtering mechanism. Primitives that become degenerate (zero area) after coordinate conversion are identified and processed differently - this harmful conversion outcome is transformed into a useful classification that enables simplified processing paths while maintaining correctness through conservative rendering.

Inventive Principle:
Principle #22Blessing in disguise (Convert harm into benefit)

3Reliability

If conservative bounding boxes are used for degenerate primitives, then reliability is improved, but processing effort increases

Engineering Contradiction:
Improverendering accuracyVSAvoidprocessing efficiency
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent segments the primitive processing pipeline into distinct paths: regular primitives follow the standard rendering path, while degenerate primitives (identified by zero area after coordinate conversion) are routed to a specialized processing path. This segmentation allows each path to be optimized independently, with degenerate primitives using simplified operations (conservative bounding boxes, flat interpolation) that are more efficient than full primitive processing.

Inventive Principle:
Principle #1Segmentation

Data Source

PatentEP4675546A1Conservative rasterization hardware
Publication Date: 2026.01.07 IMAGINATION TECH LTD
  • EP4675546A1 patent drawingFigure 1
  • EP4675546A1 patent drawingFigure 2A~2D
  • EP4675546A1 patent drawingFigure 2E~2F

AI summary

A method of rendering primitives is described. Vertex coordinates are converted from floating-point to fixed-point format and triangle primitives having non-zero area prior to the conversion and zero area after the conversion and primitives that have changed from line primitives to point primitives as a consequence of the conversion are identified. A flag is set for each identified primitive and triangle or line primitives that have changed to point primitives as a consequence of the conversion are marked as small objects. Tile lists for each tile in the rendering space are then generated by: for any primitive that is not flagged as a degenerate primitive, using one or more edge calculations to determine whether the primitive overlaps a tile; and for any primitive that is both marked as a small object and flagged as a degenerate primitive, using a conservative bounding box to determine whether the primitive overlaps a tile.