HIDDEN SURFACE REMOVAL IN GRAPHICS PROCESSING SYSTEMS

• US 20140267256A1
• Filed: 03/18/2013
• Published: 09/18/2014
• Est. Priority Date: 03/18/2013
• Status: Active Grant

• Current Assignee: Arm Ltd. (United Kingdom) (SoftBank Group Corp.)
• Original Assignee: Arm Ltd. (United Kingdom) (SoftBank Group Corp.)
• Inventors: Heggelund, Frode, Tapply, Joe, Halstvedt, Andreas Engh, Glas, Jean-Christophe
• Granted Patent: US 9,552,665 B2
• Time in Patent Office: Days
• US Class Current: 345/421
• CPC Class Codes: G06T 11/40 Filling a planar surface by adding surface attributes, e.g. colour or texture
• CPC Class Codes: G06T 15/40 Hidden part removal

Abstract

In a graphics processing pipeline 1, a primitive depth sorting stage 9 is arranged prior to the rasterisation stage 3 and rendering stage 6. The primitive depth sorting stage 9 operates to sort successive sub-sets of primitives in a stream of primitives 2 received by the graphics processing pipeline 1 based on their depth values. The so-sorted primitives are then output from the primitive depth sorting stage 9 in their sorted depth order to the rasteriser 3. This makes the depth test stages 4, 13 of the graphics processing pipeline 1 more efficient in their hidden surface removal operations, because the primitives entering the rasteriser 3 will be in depth order.

Claims

1. A method of operating a graphics processing pipeline that includes a plurality of processing stages including a rasteriser that rasterises input primitives to generate graphics fragments to be processed, each graphics fragment having one or more sampling points associated with it, and a renderer that processes fragments generated by the rasteriser to generate output fragment data, the method comprising:

when the graphics processing pipeline is processing a set of graphics primitives, depth sorting successive sub-sets of the primitives in the set of graphics primitives prior to the rasteriser generating graphics fragments for processing the primitives.

2. The method of claim 1, wherein the set of primitives to be processed comprises the primitives that are to be processed to generate a given output tile of a render target to be generated by the graphics processing pipeline.

3. The method of claim 1, comprising:

once a sub-set of primitives has been sorted, passing a primitive in the sorted sub-set onwards for processing, and adding the next primitive in the set of primitives to the remaining primitives in the previous sub-set of primitives to generate a new sub-set of primitives for sorting.

4. The method of claim 1 wherein the sorting process is performed by one of:

testing a primitive against other primitives in the sub-set one-by-one, in a linear order; and

testing a primitive against other primitives in the sub-set using a logarithmic search process.

5. The method of claim 1, further comprising:

associating each primitive in a sub-set of primitives being sorted with a respective index value; and

updating the index values associated with the primitives based on the sorting of the primitives within the sub-set.

6. The method of claim 1 wherein a queue is used to retain the sub-set of primitives while they are being sorted.

7. The method of claim 1 wherein the primitive depth sorting process comprises:

receiving a graphics primitive in the set of graphics primitives for processing, adding the primitive to a primitive queue, determining the position that the primitive should have in the queue based at least on depth values associated with the primitives in the queue, and once the position the primitive should have in the queue based at least on depth values associated with the primitives in the queue has been determined, outputting a primitive from the head of the queue to the rest of the pipeline.

8. The method of claim 1, comprising only re-ordering by the primitive sub-set sorting process primitives in the primitive set that have particular properties.

9. The method of claim 1, further comprising associating with each primitive in a primitive sub-set, information indicating whether the primitive can be re-ordered in the primitive set or not.

10. The method of claim 1, wherein the graphics processing pipeline is a tile-based graphics processing pipeline, and further comprising performing the primitive sub-set depth sorting process on a per tile basis, and depth sorting the primitives within a tile on the basis of the depth values the primitives have within the tile in question.

11. The method of claim 1, wherein the graphics processing pipeline is a tile-based graphics processing pipeline, and the primitive sub-set depth sorting process is carried out during the tiling process before the tile lists are written to memory.

12. A method of operating a graphics processing pipeline that includes a plurality of processing stages including a rasteriser that rasterises input primitives to generate graphics fragments to be processed, each graphics fragment having one or more sampling points associated with it, and a renderer that processes fragments generated by the rasteriser to generate output fragment data, the method comprising:

when the graphics processing pipeline receives a graphics primitive for processing, adding the primitive to a primitive queue, determining the order in which the primitive should exit the queue based on depth values associated with the primitives in the queue, and outputting primitives from the queue to the rest of the pipeline in the exit order determined based on the depth values associated with the primitives in the queue.

13. A graphics processing pipeline comprising:

a plurality of processing stages including a rasteriser that rasterises input primitives to generate graphics fragments to be processed, each graphics fragment having one or more sampling points associated with it, and a renderer that processes fragments generated by the rasteriser to generate output fragment data; and

further comprising;

a primitive depth sorter configured to, when the graphics processing pipeline is processing a set of graphics primitives, depth sort successive sub-sets of the primitives in the set of graphics primitives prior to the rasteriser generating graphics fragments for processing the primitives.

14. The graphics processing pipeline of claim 13, wherein the set of primitives to be processed comprises the primitives that are to be processed to generate a given output tile of a render target to be generated by the graphics processing pipeline.

15. The graphics processing pipeline of claim 13, wherein the primitive depth sorter is configured to:

once a sub-set of primitives has been sorted, pass a primitive in the sorted sub-set onwards for processing, and add the next primitive in the set of primitives to the remaining primitives in the previous sub-set of primitives to generate a new sub-set of primitives for sorting.

16. The graphics processing pipeline of claim 13, wherein the primitive depth sorter is configured to perform at least one of:

testing a primitive against other primitives in the sub-set one-by-one, in a linear order; and

testing a primitive against other primitives in the sub-set using a logarithmic search process.

17. The graphics processing pipeline of claim 13, wherein the primitive depth sorter is configured to:

associate each primitive in a sub-set of primitives being sorted with a respective index value; and

update the index values associated with the primitives based on the sorting of the primitives within the sub-set.

18. The graphics processing pipeline of claim 13, further comprising:

a queue that retains the sub-set of primitives while they are being sorted.

19. The graphics processing pipeline of claim 13, wherein the primitive depth sorter is configured to:

receive a graphics primitive in the set of graphics primitives for processing, add the primitive to a primitive queue, determine the position that the primitive should have in the queue based at least on depth values associated with the primitives in the queue, and once the position the primitive should have in the queue based at least on depth values associated with the primitives in the queue has been determined, output a primitive from the head of the queue to the rest of the pipeline.

20. The graphics processing pipeline of claim 13, wherein the primitive depth sorter is configured to:

only re-order by the primitive sub-set sorting process primitives in the primitive set that have particular properties.

21. The graphics processing pipeline of claim 13, wherein the primitive depth sorter is configured to:

associate with each primitive in a primitive sub-set, information indicating whether the primitive can be re-ordered in the primitive set or not.

22. The graphics processing pipeline of claim 13, wherein the graphics processing pipeline is a tile-based graphics processing pipeline, and wherein the primitive depth sorter is configured to:

perform the primitive sub-set depth sorting process on a per tile basis; and

depth sort the primitives within a tile on the basis of the depth values the primitives have within the tile in question.

23. The graphics processing pipeline of claim 13, wherein the graphics processing pipeline is a tile-based graphics processing pipeline, and the primitive depth sorter is configured to:

carry out the sub-set depth sorting process during the tiling process before the tile lists are written to memory.

24. A graphics processing pipeline comprising:

a plurality of processing stages including a rasteriser that rasterises input primitives to generate graphics fragments to be processed, each graphics fragment having one or more sampling points associated with it, and a renderer that processes fragments generated by the rasteriser to generate output fragment data; and

further comprising;

a primitive depth sorter configured to, when the graphics processing pipeline receives a graphics primitive for processing, add the primitive to a primitive queue, determine the order in which the primitive should exit the queue based on depth values associated with the primitives in the queue, and output primitives from the queue to the rest of the pipeline in the exit order determined based on the depth values associated with the primitives in the queue.

25. A computer readable storage medium storing computer software code which when executing on a processor performs a method of operating a graphics processing pipeline that includes a plurality of processing stages including a rasteriser that rasterises input primitives to generate graphics fragments to be processed, each graphics fragment having one or more sampling points associated with it, and a renderer that processes fragments generated by the rasteriser to generate output fragment data, the method comprising:

when the graphics processing pipeline is processing a set of graphics primitives, depth sorting successive sub-sets of the primitives in the set of graphics primitives prior to the rasteriser generating graphics fragments for processing the primitives.