{"id":"https://openalex.org/W6907764114","doi":"https://doi.org/10.2312/hpg.20161192","title":"Bandwidth-Efficient BVH Layout for Incremental Hardware Traversal","display_name":"Bandwidth-Efficient BVH Layout for Incremental Hardware Traversal","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W6907764114","doi":"https://doi.org/10.2312/hpg.20161192"},"language":"en","primary_location":{"id":"doi:10.2312/hpg.20161192","is_oa":true,"landing_page_url":"https://doi.org/10.2312/hpg.20161192","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"type":"other","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.2312/hpg.20161192","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Liktor, Gabor","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liktor, Gabor","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Vaidyanathan, Karthik","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vaidyanathan, Karthik","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T14500","display_name":"Advanced Mathematical Theories","score":0.030700000002980232,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T14500","display_name":"Advanced Mathematical Theories","score":0.030700000002980232,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12661","display_name":"Iterative Methods for Nonlinear Equations","score":0.02449999935925007,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13400","display_name":"Mathematical and Theoretical Analysis","score":0.021700000390410423,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.6047999858856201},{"id":"https://openalex.org/keywords/memory-footprint","display_name":"Memory footprint","score":0.499099999666214},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.49059998989105225},{"id":"https://openalex.org/keywords/minimum-bounding-box","display_name":"Minimum bounding box","score":0.4643000066280365},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.3986999988555908},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.396699994802475},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.3788999915122986},{"id":"https://openalex.org/keywords/memory-architecture","display_name":"Memory architecture","score":0.352400004863739},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.337799996137619}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7985000014305115},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6148999929428101},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.6047999858856201},{"id":"https://openalex.org/C74912251","wikidata":"https://www.wikidata.org/wiki/Q6815727","display_name":"Memory footprint","level":2,"score":0.499099999666214},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.49059998989105225},{"id":"https://openalex.org/C147037132","wikidata":"https://www.wikidata.org/wiki/Q6865426","display_name":"Minimum bounding box","level":3,"score":0.4643000066280365},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.3986999988555908},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.396699994802475},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.39469999074935913},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.3788999915122986},{"id":"https://openalex.org/C2779602883","wikidata":"https://www.wikidata.org/wiki/Q15544750","display_name":"Memory architecture","level":2,"score":0.352400004863739},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.337799996137619},{"id":"https://openalex.org/C28855332","wikidata":"https://www.wikidata.org/wiki/Q198099","display_name":"Quantization (signal processing)","level":2,"score":0.335999995470047},{"id":"https://openalex.org/C188045654","wikidata":"https://www.wikidata.org/wiki/Q17148339","display_name":"Memory bandwidth","level":2,"score":0.33169999718666077},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.3174999952316284},{"id":"https://openalex.org/C74426580","wikidata":"https://www.wikidata.org/wiki/Q719484","display_name":"Memory map","level":3,"score":0.3093000054359436},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.30390000343322754},{"id":"https://openalex.org/C3720319","wikidata":"https://www.wikidata.org/wiki/Q5015937","display_name":"Cache-only memory architecture","level":5,"score":0.3005000054836273},{"id":"https://openalex.org/C78669399","wikidata":"https://www.wikidata.org/wiki/Q677051","display_name":"B-tree","level":3,"score":0.2953999936580658},{"id":"https://openalex.org/C20556612","wikidata":"https://www.wikidata.org/wiki/Q4469374","display_name":"Volume (thermodynamics)","level":2,"score":0.28630000352859497},{"id":"https://openalex.org/C123657996","wikidata":"https://www.wikidata.org/wiki/Q12271","display_name":"Architecture","level":2,"score":0.28450000286102295},{"id":"https://openalex.org/C133371097","wikidata":"https://www.wikidata.org/wiki/Q868014","display_name":"Non-uniform memory access","level":5,"score":0.28029999136924744},{"id":"https://openalex.org/C184585634","wikidata":"https://www.wikidata.org/wiki/Q1434060","display_name":"Bounding volume","level":4,"score":0.2703000009059906},{"id":"https://openalex.org/C63511323","wikidata":"https://www.wikidata.org/wiki/Q908936","display_name":"Interleaved memory","level":4,"score":0.2667999863624573},{"id":"https://openalex.org/C41036726","wikidata":"https://www.wikidata.org/wiki/Q844824","display_name":"Physical address","level":3,"score":0.26330000162124634},{"id":"https://openalex.org/C118524514","wikidata":"https://www.wikidata.org/wiki/Q173212","display_name":"Computer architecture","level":1,"score":0.2621999979019165},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25859999656677246}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2312/hpg.20161192","is_oa":true,"landing_page_url":"https://doi.org/10.2312/hpg.20161192","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"doi:10.2312/hpg.20161192","is_oa":true,"landing_page_url":"https://doi.org/10.2312/hpg.20161192","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"memory":[1,35,85,116],"footprint":[2],"of":[3,20,41,51],"bounding":[4,21,39],"volume":[5],"hierarchies":[6],"(BVHs)":[7],"can":[8,45],"be":[9,46],"significantly":[10],"reduced":[11],"using":[12,106],"incremental":[13],"encoding,":[14],"which":[15],"enables":[16],"the":[17,38,42,49,52,72],"coarse":[18],"quantization":[19],"volumes.":[22],"However,":[23],"this":[24,79,104],"compression":[25],"alone":[26],"does":[27],"not":[28],"necessarily":[29],"yield":[30],"a":[31,57,83,95,112],"comparable":[32],"improvement":[33],"in":[34,115],"bandwidth.":[36],"While":[37],"volumes":[40],"BVH":[43,62,73],"nodes":[44,63],"aggressively":[47],"quantized,":[48],"size":[50],"child":[53],"node":[54,88],"pointers":[55],"remains":[56],"significant":[58,113],"overhead.":[59],"Moreover,":[60],"as":[61],"become":[64],"comparably":[65],"small":[66],"to":[67,94,119],"practical":[68],"cache":[69],"line":[70],"sizes,":[71],"is":[74],"cached":[75],"less":[76],"efficiently.":[77],"In":[78],"paper":[80],"we":[81],"introduce":[82],"novel":[84],"layout":[86],"and":[87,91,110],"addressing":[89],"scheme":[90,105],"map":[92],"it":[93],"system":[96],"architecture":[97,108],"for":[98],"fixed-function":[99],"ray":[100],"traversal.":[101],"We":[102],"evaluate":[103],"an":[107],"simulator":[109],"demonstrate":[111],"reduction":[114],"bandwidth,":[117],"compared":[118],"previous":[120],"approaches.":[121]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2025-10-10T00:00:00"}