Discrete oriented polytopes with orthogonal bases for the construction of tighter Bounding Volume Hierarchies
| Main Author: | |
|---|---|
| Publication Date: | 2024 |
| Format: | Doctoral thesis |
| Language: | eng |
| Source: | Repositório Institucional da Universidade Federal do Ceará (UFC) |
| Download full: | http://repositorio.ufc.br/handle/riufc/77407 |
Summary: | A myriad of intersection tests is necessary for culling algorithms to answer intersection queries in the field of ray tracing. BVHs are employed to accelerate such queries. OBB-based BVHs usually outperform their AABB-based counterparts in terms of culling efficiency but OBBs are more expensive to compute than AABBs. On the other hand, state-of-the-art BVH builders require linear complexity OBB building algorithms. PCA-based methods run in linear time but demand high memory bandwidth and offer poorly fitting OBBs due to statistical bias. To address these problems, we propose building OBBs with the intermediate use of an orthogonal set of polytopes bases (ODOPs) that stores the unbiased topological features of the scene and enables a straightforward conversion to OBB without the need for vertex processing. Our method supports both vertices and parametric differentiable swept volumes. This approach interfaces to state-of-the-art BVH builders by swapping AABBs in favor of ODOP routines. Our analysis focus on static scenes, highlighting the potential of ODOPs in accelerating geometric computations within ray tracing frameworks. Experiments show that OBB-BVHs built using this method usually outperform AABB-BVHs in terms of SAH costs. Moreover, the OBB-BVHs tested are observed to return query results using fewer intersection tests compared to AABB-BVHs. These measurements are consistent with the decreased rendering times observed by the adoption of our methodology in ray tracing. |
| id |
UFC-7_efe4e6302cba4a9147c254f2c70a9e11 |
|---|---|
| oai_identifier_str |
oai:repositorio.ufc.br:riufc/77407 |
| network_acronym_str |
UFC-7 |
| network_name_str |
Repositório Institucional da Universidade Federal do Ceará (UFC) |
| repository_id_str |
|
| spelling |
Sabino, Rodolfo Felipe SganzerlaCavalcante Neto, Joaquim BentoVidal, Creto Augusto2024-07-30T13:44:15Z2024-07-30T13:44:15Z2024SABINO, Rodolfo Felipe Sganzerla. Discrete oriented polytopes with orthogonal bases for the construction of tighter Bounding Volume Hierarchies. 2024. 59 f. Tese (Doutorado em Ciência da Computação) - Universidade Federal do Ceará, Fortaleza, 2024.http://repositorio.ufc.br/handle/riufc/77407A myriad of intersection tests is necessary for culling algorithms to answer intersection queries in the field of ray tracing. BVHs are employed to accelerate such queries. OBB-based BVHs usually outperform their AABB-based counterparts in terms of culling efficiency but OBBs are more expensive to compute than AABBs. On the other hand, state-of-the-art BVH builders require linear complexity OBB building algorithms. PCA-based methods run in linear time but demand high memory bandwidth and offer poorly fitting OBBs due to statistical bias. To address these problems, we propose building OBBs with the intermediate use of an orthogonal set of polytopes bases (ODOPs) that stores the unbiased topological features of the scene and enables a straightforward conversion to OBB without the need for vertex processing. Our method supports both vertices and parametric differentiable swept volumes. This approach interfaces to state-of-the-art BVH builders by swapping AABBs in favor of ODOP routines. Our analysis focus on static scenes, highlighting the potential of ODOPs in accelerating geometric computations within ray tracing frameworks. Experiments show that OBB-BVHs built using this method usually outperform AABB-BVHs in terms of SAH costs. Moreover, the OBB-BVHs tested are observed to return query results using fewer intersection tests compared to AABB-BVHs. These measurements are consistent with the decreased rendering times observed by the adoption of our methodology in ray tracing.Rotinas de teste de interseção são executadas em larga quantidade para responder às consultas de interseção de raio com a cena no campo de Ray Tracing. Bounding Box Hierarchies (BVHs) são estruturas empregadas para acelerar tais consultas. As BVHs construídas a partir de Oriented Bounding Boxes (OBBs) geralmente superam suas equivalentes baseadas em Axis-Aligned Bounding Boxes (AABBs) em termos de eficiência de corte. Porém, a computação de OBBs é mais cara comparada ao custo de computação de AABBs. Por outro lado, construtores de BVH de última geração exigem algoritmos de construção de OBB de complexidade linear. Os Métodos baseados em Principal Component Analysis (PCA), usados para a computação de OBBs, são de complexidade linear, mas exigem uma alto tráfego de memória e oferecem OBBs mal ajustadas aos objetos da cena devido ao seu intrínseco viés estatístico. Esse trabalho propõe um novo método de construção de OBBs para resolver esse problema. OBBs são computadas pelo uso de Discrete Oriented Polytopes With Orthogonal Bases (ODOPs). ODOPs armazenam as características topológicas não enviesadas da cena e permitem uma conversão direta para OBBs sem a necessidade de processamento de vértices. O método suporta malhas de vértices e volumes paramétricos diferenciáveis. O método é incorporado a um construtor de BVH de última geração, trocando AABBs em favor de rotinas ODOPs. Experimentos mostram que as OBB-BVHs construídas usando esse método superam AABB-BVHs em termos de custos de Surface Area Heuristic (SAH). Além disso, observa-se que as OBB-BVHs testadas retornam resultados de consultas usando menos testes de interseção em comparação com as AABB-BVHs. Essas medições são consistentes com a diminuição dos tempos de renderização observados pela adoção de nossa metodologia em ray tracing.Discrete oriented polytopes with orthogonal bases for the construction of tighter Bounding Volume HierarchiesDiscrete oriented polytopes with orthogonal bases for the construction of tighter Bounding Volume Hierarchiesinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/doctoralThesisRay TracingBounding Volume HierarchyOriented Bounding BoxOrthogonal Discrete Oriented PolytopeBVHOBBODOPRay TracingBounding Volume HierarchyOriented Bounding BoxOrthogonal Discrete Oriented PolytopeBVHOBBODOPCNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAOinfo:eu-repo/semantics/openAccessengreponame:Repositório Institucional da Universidade Federal do Ceará (UFC)instname:Universidade Federal do Ceará (UFC)instacron:UFChttp://lattes.cnpq.br/7910859531631057http://lattes.cnpq.br/9499398320838094http://lattes.cnpq.br/08662053479722032024-07-30ORIGINAL2024_tese_rfssabino.pdf2024_tese_rfssabino.pdfapplication/pdf27368728http://repositorio.ufc.br/bitstream/riufc/77407/1/2024_tese_rfssabino.pdf38804ef93dbda54b576ef1793370b663MD51LICENSElicense.txtlicense.txttext/plain; charset=utf-81748http://repositorio.ufc.br/bitstream/riufc/77407/2/license.txt8a4605be74aa9ea9d79846c1fba20a33MD52riufc/774072024-07-30 10:44:16.476oai:repositorio.ufc.br:riufc/77407Tk9URTogUExBQ0UgWU9VUiBPV04gTElDRU5TRSBIRVJFClRoaXMgc2FtcGxlIGxpY2Vuc2UgaXMgcHJvdmlkZWQgZm9yIGluZm9ybWF0aW9uYWwgcHVycG9zZXMgb25seS4KCk5PTi1FWENMVVNJVkUgRElTVFJJQlVUSU9OIExJQ0VOU0UKCkJ5IHNpZ25pbmcgYW5kIHN1Ym1pdHRpbmcgdGhpcyBsaWNlbnNlLCB5b3UgKHRoZSBhdXRob3Iocykgb3IgY29weXJpZ2h0Cm93bmVyKSBncmFudHMgdG8gRFNwYWNlIFVuaXZlcnNpdHkgKERTVSkgdGhlIG5vbi1leGNsdXNpdmUgcmlnaHQgdG8gcmVwcm9kdWNlLAp0cmFuc2xhdGUgKGFzIGRlZmluZWQgYmVsb3cpLCBhbmQvb3IgZGlzdHJpYnV0ZSB5b3VyIHN1Ym1pc3Npb24gKGluY2x1ZGluZwp0aGUgYWJzdHJhY3QpIHdvcmxkd2lkZSBpbiBwcmludCBhbmQgZWxlY3Ryb25pYyBmb3JtYXQgYW5kIGluIGFueSBtZWRpdW0sCmluY2x1ZGluZyBidXQgbm90IGxpbWl0ZWQgdG8gYXVkaW8gb3IgdmlkZW8uCgpZb3UgYWdyZWUgdGhhdCBEU1UgbWF5LCB3aXRob3V0IGNoYW5naW5nIHRoZSBjb250ZW50LCB0cmFuc2xhdGUgdGhlCnN1Ym1pc3Npb24gdG8gYW55IG1lZGl1bSBvciBmb3JtYXQgZm9yIHRoZSBwdXJwb3NlIG9mIHByZXNlcnZhdGlvbi4KCllvdSBhbHNvIGFncmVlIHRoYXQgRFNVIG1heSBrZWVwIG1vcmUgdGhhbiBvbmUgY29weSBvZiB0aGlzIHN1Ym1pc3Npb24gZm9yCnB1cnBvc2VzIG9mIHNlY3VyaXR5LCBiYWNrLXVwIGFuZCBwcmVzZXJ2YXRpb24uCgpZb3UgcmVwcmVzZW50IHRoYXQgdGhlIHN1Ym1pc3Npb24gaXMgeW91ciBvcmlnaW5hbCB3b3JrLCBhbmQgdGhhdCB5b3UgaGF2ZQp0aGUgcmlnaHQgdG8gZ3JhbnQgdGhlIHJpZ2h0cyBjb250YWluZWQgaW4gdGhpcyBsaWNlbnNlLiBZb3UgYWxzbyByZXByZXNlbnQKdGhhdCB5b3VyIHN1Ym1pc3Npb24gZG9lcyBub3QsIHRvIHRoZSBiZXN0IG9mIHlvdXIga25vd2xlZGdlLCBpbmZyaW5nZSB1cG9uCmFueW9uZSdzIGNvcHlyaWdodC4KCklmIHRoZSBzdWJtaXNzaW9uIGNvbnRhaW5zIG1hdGVyaWFsIGZvciB3aGljaCB5b3UgZG8gbm90IGhvbGQgY29weXJpZ2h0LAp5b3UgcmVwcmVzZW50IHRoYXQgeW91IGhhdmUgb2J0YWluZWQgdGhlIHVucmVzdHJpY3RlZCBwZXJtaXNzaW9uIG9mIHRoZQpjb3B5cmlnaHQgb3duZXIgdG8gZ3JhbnQgRFNVIHRoZSByaWdodHMgcmVxdWlyZWQgYnkgdGhpcyBsaWNlbnNlLCBhbmQgdGhhdApzdWNoIHRoaXJkLXBhcnR5IG93bmVkIG1hdGVyaWFsIGlzIGNsZWFybHkgaWRlbnRpZmllZCBhbmQgYWNrbm93bGVkZ2VkCndpdGhpbiB0aGUgdGV4dCBvciBjb250ZW50IG9mIHRoZSBzdWJtaXNzaW9uLgoKSUYgVEhFIFNVQk1JU1NJT04gSVMgQkFTRUQgVVBPTiBXT1JLIFRIQVQgSEFTIEJFRU4gU1BPTlNPUkVEIE9SIFNVUFBPUlRFRApCWSBBTiBBR0VOQ1kgT1IgT1JHQU5JWkFUSU9OIE9USEVSIFRIQU4gRFNVLCBZT1UgUkVQUkVTRU5UIFRIQVQgWU9VIEhBVkUKRlVMRklMTEVEIEFOWSBSSUdIVCBPRiBSRVZJRVcgT1IgT1RIRVIgT0JMSUdBVElPTlMgUkVRVUlSRUQgQlkgU1VDSApDT05UUkFDVCBPUiBBR1JFRU1FTlQuCgpEU1Ugd2lsbCBjbGVhcmx5IGlkZW50aWZ5IHlvdXIgbmFtZShzKSBhcyB0aGUgYXV0aG9yKHMpIG9yIG93bmVyKHMpIG9mIHRoZQpzdWJtaXNzaW9uLCBhbmQgd2lsbCBub3QgbWFrZSBhbnkgYWx0ZXJhdGlvbiwgb3RoZXIgdGhhbiBhcyBhbGxvd2VkIGJ5IHRoaXMKbGljZW5zZSwgdG8geW91ciBzdWJtaXNzaW9uLgo=Repositório InstitucionalPUBhttp://www.repositorio.ufc.br/ri-oai/requestbu@ufc.br || repositorio@ufc.bropendoar:2024-07-30T13:44:16Repositório Institucional da Universidade Federal do Ceará (UFC) - Universidade Federal do Ceará (UFC)false |
| dc.title.pt_BR.fl_str_mv |
Discrete oriented polytopes with orthogonal bases for the construction of tighter Bounding Volume Hierarchies |
| dc.title.en.pt_BR.fl_str_mv |
Discrete oriented polytopes with orthogonal bases for the construction of tighter Bounding Volume Hierarchies |
| title |
Discrete oriented polytopes with orthogonal bases for the construction of tighter Bounding Volume Hierarchies |
| spellingShingle |
Discrete oriented polytopes with orthogonal bases for the construction of tighter Bounding Volume Hierarchies Sabino, Rodolfo Felipe Sganzerla CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO Ray Tracing Bounding Volume Hierarchy Oriented Bounding Box Orthogonal Discrete Oriented Polytope BVH OBB ODOP Ray Tracing Bounding Volume Hierarchy Oriented Bounding Box Orthogonal Discrete Oriented Polytope BVH OBB ODOP |
| title_short |
Discrete oriented polytopes with orthogonal bases for the construction of tighter Bounding Volume Hierarchies |
| title_full |
Discrete oriented polytopes with orthogonal bases for the construction of tighter Bounding Volume Hierarchies |
| title_fullStr |
Discrete oriented polytopes with orthogonal bases for the construction of tighter Bounding Volume Hierarchies |
| title_full_unstemmed |
Discrete oriented polytopes with orthogonal bases for the construction of tighter Bounding Volume Hierarchies |
| title_sort |
Discrete oriented polytopes with orthogonal bases for the construction of tighter Bounding Volume Hierarchies |
| author |
Sabino, Rodolfo Felipe Sganzerla |
| author_facet |
Sabino, Rodolfo Felipe Sganzerla |
| author_role |
author |
| dc.contributor.co-advisor.none.fl_str_mv |
Cavalcante Neto, Joaquim Bento |
| dc.contributor.author.fl_str_mv |
Sabino, Rodolfo Felipe Sganzerla |
| dc.contributor.advisor1.fl_str_mv |
Vidal, Creto Augusto |
| contributor_str_mv |
Vidal, Creto Augusto |
| dc.subject.cnpq.fl_str_mv |
CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO |
| topic |
CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO Ray Tracing Bounding Volume Hierarchy Oriented Bounding Box Orthogonal Discrete Oriented Polytope BVH OBB ODOP Ray Tracing Bounding Volume Hierarchy Oriented Bounding Box Orthogonal Discrete Oriented Polytope BVH OBB ODOP |
| dc.subject.ptbr.pt_BR.fl_str_mv |
Ray Tracing Bounding Volume Hierarchy Oriented Bounding Box Orthogonal Discrete Oriented Polytope BVH OBB ODOP |
| dc.subject.en.pt_BR.fl_str_mv |
Ray Tracing Bounding Volume Hierarchy Oriented Bounding Box Orthogonal Discrete Oriented Polytope BVH OBB ODOP |
| description |
A myriad of intersection tests is necessary for culling algorithms to answer intersection queries in the field of ray tracing. BVHs are employed to accelerate such queries. OBB-based BVHs usually outperform their AABB-based counterparts in terms of culling efficiency but OBBs are more expensive to compute than AABBs. On the other hand, state-of-the-art BVH builders require linear complexity OBB building algorithms. PCA-based methods run in linear time but demand high memory bandwidth and offer poorly fitting OBBs due to statistical bias. To address these problems, we propose building OBBs with the intermediate use of an orthogonal set of polytopes bases (ODOPs) that stores the unbiased topological features of the scene and enables a straightforward conversion to OBB without the need for vertex processing. Our method supports both vertices and parametric differentiable swept volumes. This approach interfaces to state-of-the-art BVH builders by swapping AABBs in favor of ODOP routines. Our analysis focus on static scenes, highlighting the potential of ODOPs in accelerating geometric computations within ray tracing frameworks. Experiments show that OBB-BVHs built using this method usually outperform AABB-BVHs in terms of SAH costs. Moreover, the OBB-BVHs tested are observed to return query results using fewer intersection tests compared to AABB-BVHs. These measurements are consistent with the decreased rendering times observed by the adoption of our methodology in ray tracing. |
| publishDate |
2024 |
| dc.date.accessioned.fl_str_mv |
2024-07-30T13:44:15Z |
| dc.date.available.fl_str_mv |
2024-07-30T13:44:15Z |
| dc.date.issued.fl_str_mv |
2024 |
| dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
| dc.type.driver.fl_str_mv |
info:eu-repo/semantics/doctoralThesis |
| format |
doctoralThesis |
| status_str |
publishedVersion |
| dc.identifier.citation.fl_str_mv |
SABINO, Rodolfo Felipe Sganzerla. Discrete oriented polytopes with orthogonal bases for the construction of tighter Bounding Volume Hierarchies. 2024. 59 f. Tese (Doutorado em Ciência da Computação) - Universidade Federal do Ceará, Fortaleza, 2024. |
| dc.identifier.uri.fl_str_mv |
http://repositorio.ufc.br/handle/riufc/77407 |
| identifier_str_mv |
SABINO, Rodolfo Felipe Sganzerla. Discrete oriented polytopes with orthogonal bases for the construction of tighter Bounding Volume Hierarchies. 2024. 59 f. Tese (Doutorado em Ciência da Computação) - Universidade Federal do Ceará, Fortaleza, 2024. |
| url |
http://repositorio.ufc.br/handle/riufc/77407 |
| dc.language.iso.fl_str_mv |
eng |
| language |
eng |
| dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
| eu_rights_str_mv |
openAccess |
| dc.source.none.fl_str_mv |
reponame:Repositório Institucional da Universidade Federal do Ceará (UFC) instname:Universidade Federal do Ceará (UFC) instacron:UFC |
| instname_str |
Universidade Federal do Ceará (UFC) |
| instacron_str |
UFC |
| institution |
UFC |
| reponame_str |
Repositório Institucional da Universidade Federal do Ceará (UFC) |
| collection |
Repositório Institucional da Universidade Federal do Ceará (UFC) |
| bitstream.url.fl_str_mv |
http://repositorio.ufc.br/bitstream/riufc/77407/1/2024_tese_rfssabino.pdf http://repositorio.ufc.br/bitstream/riufc/77407/2/license.txt |
| bitstream.checksum.fl_str_mv |
38804ef93dbda54b576ef1793370b663 8a4605be74aa9ea9d79846c1fba20a33 |
| bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 |
| repository.name.fl_str_mv |
Repositório Institucional da Universidade Federal do Ceará (UFC) - Universidade Federal do Ceará (UFC) |
| repository.mail.fl_str_mv |
bu@ufc.br || repositorio@ufc.br |
| _version_ |
1847792455060029440 |