Bounding volume hierarchy (BVH) widening based on node compressibility
Systems and techniques are provided for widening a hierarchical structure for ray tracing. For instance, a process can include obtaining a plurality of primitives of a scene object included in a first hierarchical acceleration data structure and determining one or more candidate hierarchical acceler...
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Patent |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Alla, Srihari Babu Nagendra Kumar, Jonnala Gadda Seetharamaiah, Avinash McAllister, David Kirk Ramesh Babu, Adimulam |
| description | Systems and techniques are provided for widening a hierarchical structure for ray tracing. For instance, a process can include obtaining a plurality of primitives of a scene object included in a first hierarchical acceleration data structure and determining one or more candidate hierarchical acceleration data structures each including the plurality of primitives. A cost metric can be determined for the one or more candidate hierarchical acceleration data structures and, based on the cost metric, a compressibility prediction associated with a candidate hierarchical acceleration data structure of the one or more candidate hierarchical acceleration data structures can be determined. An output hierarchical acceleration data structure can be generated based on the compressibility prediction. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US11893677B1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US11893677B1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US11893677B13</originalsourceid><addsrcrecordid>eNrjZHBzyi_NS8nMS1coy88pzU1VyMhMLUosSs6oVNBwCvPQVCjPTEnNA8knJRanpijk5ynk5aekKiTn5xYUpRYXZyZl5mSWVPIwsKYl5hSn8kJpbgZFN9cQZw_d1IL8-NTigsTk1LzUkvjQYENDC0tjM3NzJ0NjYtQAAPaeM2o</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Bounding volume hierarchy (BVH) widening based on node compressibility</title><source>esp@cenet</source><creator>Alla, Srihari Babu ; Nagendra Kumar, Jonnala Gadda ; Seetharamaiah, Avinash ; McAllister, David Kirk ; Ramesh Babu, Adimulam</creator><creatorcontrib>Alla, Srihari Babu ; Nagendra Kumar, Jonnala Gadda ; Seetharamaiah, Avinash ; McAllister, David Kirk ; Ramesh Babu, Adimulam</creatorcontrib><description>Systems and techniques are provided for widening a hierarchical structure for ray tracing. For instance, a process can include obtaining a plurality of primitives of a scene object included in a first hierarchical acceleration data structure and determining one or more candidate hierarchical acceleration data structures each including the plurality of primitives. A cost metric can be determined for the one or more candidate hierarchical acceleration data structures and, based on the cost metric, a compressibility prediction associated with a candidate hierarchical acceleration data structure of the one or more candidate hierarchical acceleration data structures can be determined. An output hierarchical acceleration data structure can be generated based on the compressibility prediction.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; IMAGE DATA PROCESSING OR GENERATION, IN GENERAL ; PHYSICS</subject><creationdate>2024</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20240206&DB=EPODOC&CC=US&NR=11893677B1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76516</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20240206&DB=EPODOC&CC=US&NR=11893677B1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Alla, Srihari Babu</creatorcontrib><creatorcontrib>Nagendra Kumar, Jonnala Gadda</creatorcontrib><creatorcontrib>Seetharamaiah, Avinash</creatorcontrib><creatorcontrib>McAllister, David Kirk</creatorcontrib><creatorcontrib>Ramesh Babu, Adimulam</creatorcontrib><title>Bounding volume hierarchy (BVH) widening based on node compressibility</title><description>Systems and techniques are provided for widening a hierarchical structure for ray tracing. For instance, a process can include obtaining a plurality of primitives of a scene object included in a first hierarchical acceleration data structure and determining one or more candidate hierarchical acceleration data structures each including the plurality of primitives. A cost metric can be determined for the one or more candidate hierarchical acceleration data structures and, based on the cost metric, a compressibility prediction associated with a candidate hierarchical acceleration data structure of the one or more candidate hierarchical acceleration data structures can be determined. An output hierarchical acceleration data structure can be generated based on the compressibility prediction.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>IMAGE DATA PROCESSING OR GENERATION, IN GENERAL</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2024</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZHBzyi_NS8nMS1coy88pzU1VyMhMLUosSs6oVNBwCvPQVCjPTEnNA8knJRanpijk5ynk5aekKiTn5xYUpRYXZyZl5mSWVPIwsKYl5hSn8kJpbgZFN9cQZw_d1IL8-NTigsTk1LzUkvjQYENDC0tjM3NzJ0NjYtQAAPaeM2o</recordid><startdate>20240206</startdate><enddate>20240206</enddate><creator>Alla, Srihari Babu</creator><creator>Nagendra Kumar, Jonnala Gadda</creator><creator>Seetharamaiah, Avinash</creator><creator>McAllister, David Kirk</creator><creator>Ramesh Babu, Adimulam</creator><scope>EVB</scope></search><sort><creationdate>20240206</creationdate><title>Bounding volume hierarchy (BVH) widening based on node compressibility</title><author>Alla, Srihari Babu ; Nagendra Kumar, Jonnala Gadda ; Seetharamaiah, Avinash ; McAllister, David Kirk ; Ramesh Babu, Adimulam</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US11893677B13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2024</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>IMAGE DATA PROCESSING OR GENERATION, IN GENERAL</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>Alla, Srihari Babu</creatorcontrib><creatorcontrib>Nagendra Kumar, Jonnala Gadda</creatorcontrib><creatorcontrib>Seetharamaiah, Avinash</creatorcontrib><creatorcontrib>McAllister, David Kirk</creatorcontrib><creatorcontrib>Ramesh Babu, Adimulam</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Alla, Srihari Babu</au><au>Nagendra Kumar, Jonnala Gadda</au><au>Seetharamaiah, Avinash</au><au>McAllister, David Kirk</au><au>Ramesh Babu, Adimulam</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Bounding volume hierarchy (BVH) widening based on node compressibility</title><date>2024-02-06</date><risdate>2024</risdate><abstract>Systems and techniques are provided for widening a hierarchical structure for ray tracing. For instance, a process can include obtaining a plurality of primitives of a scene object included in a first hierarchical acceleration data structure and determining one or more candidate hierarchical acceleration data structures each including the plurality of primitives. A cost metric can be determined for the one or more candidate hierarchical acceleration data structures and, based on the cost metric, a compressibility prediction associated with a candidate hierarchical acceleration data structure of the one or more candidate hierarchical acceleration data structures can be determined. An output hierarchical acceleration data structure can be generated based on the compressibility prediction.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_epo_espacenet_US11893677B1 |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING IMAGE DATA PROCESSING OR GENERATION, IN GENERAL PHYSICS |
| title | Bounding volume hierarchy (BVH) widening based on node compressibility |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-16T09%3A33%3A50IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=Alla,%20Srihari%20Babu&rft.date=2024-02-06&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS11893677B1%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |