Bounding Box Generation Circuit for Tile-Based Graphics
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In tile-based graphics processing, the current methods for defining bounding boxes are either computationally expensive or overestimate the number of tiles, leading to increased memory bandwidth requirements, which is particularly problematic for devices with limited resources such as SoC mobile devices.
Innovation Solution
The method involves determining part-way points between vertices of primitives and defining multiple bounding boxes that intersect these points, allowing for more accurate determination of tile coverage with reduced computational expense and memory bandwidth usage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of energy
If traditional bounding box methods are used to determine tile coverage, then computational simplicity is maintained, but memory bandwidth requirements increase due to overestimation of tile coverage
Solution Approach 1:
The primitive is divided into multiple segments by calculating part-way points between vertices. Multiple bounding boxes are then defined for these segments instead of using a single bounding box for the entire primitive. This segmentation allows for more precise tile coverage determination, reducing overestimation and thereby decreasing memory bandwidth requirements while maintaining accurate tile determination.
2Measurement precision
If multiple bounding boxes are defined to improve tile coverage accuracy, then memory bandwidth requirements are reduced, but computational expense increases
Solution Approach 1:
Instead of defining multiple bounding boxes for every possible segment of every primitive, the method selectively applies part-way point calculations and multiple bounding box definitions only where necessary to achieve accurate tile coverage determination. This partial action approach maintains computational efficiency while still reducing memory bandwidth requirements through improved precision where it matters most.
Data Source
AI summary
There is provided a computer-implemented method of defining bounding boxes for a primitive in a tile-based graphics processing pipeline comprising determining a part-way point on the primitive, wherein, for each pair of vertices, a part-way point is part-way between that pair of vertices, and defining a plurality of bounding boxes, wherein each bounding box intersects a part-way point. Also provided is a bounding box generation circuit comprising a part-way point calculation circuit to determine a part-way point on the primitive, wherein, for each pair of vertices, a part-way point is part-way between that pair of vertices, wherein the bounding box generation circuit to define a plurality of bounding boxes based upon the determined part-way point, wherein each bounding box intersects a part-way point. A method of defining bounding boxes for a point primitive is also provided.


