Write out stage generated bounding volumes

US11094102B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-11094102-B2
Application numberUS-202016797125-A
CountryUS
Kind codeB2
Filing dateFeb 21, 2020
Priority dateApr 1, 2017
Publication dateAug 17, 2021
Grant dateAug 17, 2021

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

Systems, apparatuses and methods may provide for technology that optimizes tiled rendering for workloads in a graphics pipeline including tessellation and use of a geometry shader. More particularly, systems, apparatuses and methods may provide a way to generate, by a write out fixed-function stage, one or more bounding volumes based on geometry data, as inputs to one or more stages of the graphics pipeline. The systems, apparatuses and methods may compute multiple bounding volumes in parallel, and improve the gamer experience, and enable photorealistic renderings at full speed, (e.g., such as human skin and facial expressions) that render three-dimensional (3D) action more realistically.

First claim

Opening claim text (preview).

What is claimed is: 1. A system comprising: a memory including one or more write out buffers; and a graphics pipeline apparatus comprising one or more processors and a write out fixed-function stage, implemented at least partly in electronic circuitry, to receive geometry data for one or more objects, and generate, based on the geometry data, one or more bounding volumes as inputs to one or more graphics processing stages, and write processed vertex data from the one or more graphics processing stages to the one or more write out buffers according to the bounding volumes; wherein the write out fixed-function stage is triggered to write the one or more bounding volumes into the one or more write out buffers in response to at least a bounding volume N-dimensional state being changed from an enabled state to a disabled state, wherein N is an integer equal to 3 or 4, and wherein when the graphics pipeline apparatus comprises a plurality of processors, the graphics pipeline apparatus includes one or more communication paths between the processors, the one or more communication paths consisting essentially of one or more of an interconnect fabric, a high-speed bus or a point-to-point interconnect. 2. The system of claim 1 , wherein the write out fixed-function stage is to generate the one or more bounding volumes without host processor synchronization. 3. The system of claim 2 , wherein the one or more bounding volumes include bounding volumes of a three-dimensional (3D) object. 4. The system of claim 3 , wherein the write out fixed-function stage writes a portion of transformed 3D vertices into the one or more write out buffers. 5. The system of claim 4 , wherein the write out fixed-function stage is to calculate or output the one or more bounding volumes for each patch of a tessellated draw for a tessellated draw call. 6. The system of claim 5 , wherein the one or more bounding volumes are to be written consecutively into the one or more write out buffers, and wherein each of the bounding volumes are defined by a minimum bounds and a maximum bounds for each dimension of an N dimensional bounding volume. 7. The system of claim 1 , wherein the one or more bounding volumes based on the geometry data are used as inputs to the one or more graphics processing stages to perform one or more of sorting objects, intersection detections or other graphics processing. 8. The system of claim 1 , further comprising a display subsystem communicatively coupled to the graphics pipeline apparatus, wherein the display subsystem is to visually present one or more scenes associated with the bounding volumes. 9. The system of claim 8 , further comprising a power source to supply power to the system. 10. A method comprising: receiving, by a write out fixed-function stage of a graphics pipeline apparatus, geometry data for one or more objects, the graphics pipeline apparatus comprising one or more processors; generating, by the write out fixed-function stage, based on the geometry data, one or more bounding volumes as inputs to one or more stages of the graphics pipeline apparatus; and writing out, by the write out fixed-function stage, processed vertex data from the one or more stages of the graphics pipeline apparatus to one or more write out buffers according to the bounding volumes, wherein the write out fixed-function stage is triggered to write the one or more bounding volumes into the one or more write out buffers in response to at least a bounding volume N-dimensional state being changed from an enabled state to a disabled state, wherein N is an integer equal to 3 or 4, and wherein when the graphics pipeline apparatus comprises a plurality of processors, the graphics pipeline apparatus includes one or more communication paths between the processors, the one or more communication paths consisting essentially of one or more of an interconnect fabric, a high-speed bus or a point-to-point interconnect. 11. The method of claim 10 , wherein the one or more bounding volumes are generated without host processor synchronization. 12. The method of claim 11 , wherein the one or more bounding volumes include bounding volumes of a three-dimensional (3D) object. 13. The method of claim 12 , further comprising writing a portion of transformed 3D vertices into the one or more write out buffers of a memory. 14. The method of claim 13 , further comprising: calculating or outputting the one or more bounding volumes for each patch of a tessellated draw for a tessellated draw call. 15. The method of claim 14 , wherein each of the bounding volumes is defined by a minimum bounds and a maximum bounds for each dimension of an N dimensional bounding volume. 16. The method of claim 10 , wherein the one or more bounding volumes based on the geometry data are used as inputs to the one or more stages of the graphics pipeline apparatus to perform one or more of sorting objects, intersection detections or other graphics processing. 17. At least one non-transitory computer readable storage medium comprising a set of instructions which, when executed by a computing device, cause the computing device to: receive, by a write out fixed-function stage of a graphics pipeline apparatus, geometry data for one or more objects, the graphics pipeline apparatus comprising one or more processors; generate, by the write out fixed-function stage, based on the geometry data, one or more bounding volumes as inputs to one or more stages of the graphics pipeline apparatus; and write out, by the write out fixed-function stage, processed vertex data from the one or more stages of the graphics pipeline apparatus to one or more write out buffers according to the bounding volumes, wherein the write out fixed-function stage is triggered to write the one or more bounding volumes into the one or more write out buffers in response to at least a bounding volume N-dimensional state being changed from an enabled state to a disabled state, wherein N is an integer equal to 3 or 4, and wherein when the graphics pipeline apparatus comprises a plurality of processors, the graphics pipeline apparatus includes one or more communication paths between the processors, the one or more communication paths consisting essentially of one or more of an interconnect fabric, a high-speed bus or a point-to-point interconnect. 18. The at least one non-transitory computer readable storage medium of claim 17 , wherein the one or more bounding volumes are generated without host processor synchronization. 19. The at least one non-transitory computer readable storage medium of claim 18 , wherein the one or more bounding volumes include bounding volumes of a three-dimensional (3D) object. 20. The at least one non-transitory computer readable storage medium of claim 19 , wherein the instructions, when executed, further cause the computing system to write a portion of transformed 3D vertices into the one or more write out buffers of a memory. 21. The at least one non-transitory computer readable storage medium of claim 20 , wherein the instructions, when executed, further cause the computing system to calculate or output the one or more bounding volumes for each patch of a tessellated draw for a tessellated draw call. 22. The at least one non-transitory computer readable storage medium of claim 21 , wherein each of the bounding volumes is defined by a minimum bounds and a maximum bounds for each dimension of an N dimensional bounding volume. 23. The at le

Assignees

Inventors

Classifications

  • controlled by a single instruction for multiple threads [SIMT] in parallel · CPC title

  • from multiple instruction streams, e.g. multistreaming · CPC title

  • Bounding box · CPC title

  • Register renaming · CPC title

  • G06T1/20Primary

    Processor architectures; Processor configuration, e.g. pipelining · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US11094102B2 cover?
Systems, apparatuses and methods may provide for technology that optimizes tiled rendering for workloads in a graphics pipeline including tessellation and use of a geometry shader. More particularly, systems, apparatuses and methods may provide a way to generate, by a write out fixed-function stage, one or more bounding volumes based on geometry data, as inputs to one or more stages of the grap…
Who is the assignee on this patent?
Intel Corp
What technology area does this patent fall under?
Primary CPC classification G06T1/20. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Aug 17 2021 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 12 related publications on this page (citations in our corpus or others sharing the same primary CPC).