Z-Plane Representation for Depth Buffer Compression

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current computer graphics technologies face challenges in efficiently storing and interpolating depth values for 3D scenes, leading to issues with data compression and precision, particularly at block edges, which can result in artifacts and inaccuracies in rendering 3D models.

Innovation Solution

The implementation of a Z-plane representation that uses a planar equation to compactly store depth values, allowing for efficient interpolation and storage by defining depth as a function of Xslope, Yslope, and Zref, which replaces individual depth values at each pixel, and is optimized for common depth formats like Float32, Unorm16, and Unorm24 to minimize interpolation errors and artifacts.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If individual depth values are stored at each pixel, then precision is maintained, but data compression is reduced

Engineering Contradiction:
Improvedepth value precisionVSAvoiddata storage volume
Core Design Contradiction:
Measurement precisionVSQuantity of substance

Solution Approach 1:

The patent transforms the storage representation from individual per-pixel depth values to a planar equation parameter set (Ax + By + Cz + D = 0). This parameter change enables compact storage of depth information while maintaining the ability to reconstruct precise depth values through linear interpolation, resolving the contradiction between precision and data volume.

Inventive Principle:
Principle #35Parameter changes

2Quantity of substance

If block compression is applied to depth values, then data storage efficiency improves, but artifacts appear at block edges

Engineering Contradiction:
Improvedata storage efficiencyVSAvoidrendering accuracy
Core Design Contradiction:
Quantity of substanceVSReliability

Solution Approach 1:

By representing depth values through planar equation parameters rather than compressed block-wise per-pixel values, the patent ensures mathematical continuity across block boundaries. The planar representation guarantees that depth values at block edges are consistently interpolated from the same plane equation, eliminating artifacts while maintaining compression efficiency.

Inventive Principle:
Principle #35Parameter changes

3Device complexity

If depth values are interpolated from vertex values, then rendering is simplified, but precision is lost due to linear interpolation limitations

Engineering Contradiction:
Improverendering complexityVSAvoiddepth interpolation precision
Core Design Contradiction:
Device complexityVSMeasurement precision

Solution Approach 1:

The patent enhances the traditional linear interpolation approach by using planar equation parameters (A, B, C, D) that explicitly represent the depth surface. This parameterization allows for more accurate depth reconstruction through the plane equation Z = (-(Ax + By + D))/C, maintaining rendering simplicity while improving precision over standard linear interpolation.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS10019836B2Planar depth representations for block compression
Publication Date: 2018.07.10 INTEL CORP
  • US10019836B2 patent drawing
  • US10019836B2 patent drawing
  • US10019836B2 patent drawing

AI summary

Described herein are technologies related to facilitate high precision and resolution of a depth (Z) buffer storage during a process of rendering 3D scenes. More particularly, during an interpolation, encoding, and/or storing processes in a graphic pipeline for rendering the 3D scenes, a particular depth (Z) plane representation is configured to support an un-normalized depth and a floating point depth formats that may be used to store Z values to the Z buffer storage.