{"id":"https://openalex.org/W2141966484","doi":"https://doi.org/10.1145/2018323.2018333","title":"Simpler and faster HLBVH with work queues","display_name":"Simpler and faster HLBVH with work queues","publication_year":2011,"publication_date":"2011-08-05","ids":{"openalex":"https://openalex.org/W2141966484","doi":"https://doi.org/10.1145/2018323.2018333","mag":"2141966484"},"language":"en","primary_location":{"id":"doi:10.1145/2018323.2018333","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2018323.2018333","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM SIGGRAPH Symposium on High Performance Graphics","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008819968","display_name":"Kirill Garanzha","orcid":null},"institutions":[{"id":"https://openalex.org/I86427540","display_name":"Keldysh Institute of Applied Mathematics","ror":"https://ror.org/01dv3hq14","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210124601","https://openalex.org/I86427540"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Kirill Garanzha","raw_affiliation_strings":["NVIDIA, Keldysh Institute of Applied Mathematics","NVIDIA, Keldysh Institute of Applied Mathematics#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NVIDIA, Keldysh Institute of Applied Mathematics","institution_ids":["https://openalex.org/I86427540"]},{"raw_affiliation_string":"NVIDIA, Keldysh Institute of Applied Mathematics#TAB#","institution_ids":["https://openalex.org/I86427540"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027345065","display_name":"Jacopo Pantaleoni","orcid":"https://orcid.org/0000-0001-6260-6815"},"institutions":[{"id":"https://openalex.org/I1304085615","display_name":"Nvidia (United Kingdom)","ror":"https://ror.org/02kr42612","country_code":"GB","type":"company","lineage":["https://openalex.org/I1304085615","https://openalex.org/I4210127875"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Jacopo Pantaleoni","raw_affiliation_strings":["NVIDIA Research","[NVIDIA Research]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NVIDIA Research","institution_ids":["https://openalex.org/I1304085615"]},{"raw_affiliation_string":"[NVIDIA Research]","institution_ids":["https://openalex.org/I1304085615"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054303062","display_name":"David McAllister","orcid":null},"institutions":[{"id":"https://openalex.org/I1304085615","display_name":"Nvidia (United Kingdom)","ror":"https://ror.org/02kr42612","country_code":"GB","type":"company","lineage":["https://openalex.org/I1304085615","https://openalex.org/I4210127875"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"David McAllister","raw_affiliation_strings":["NVIDIA","Nvidia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NVIDIA","institution_ids":[]},{"raw_affiliation_string":"Nvidia","institution_ids":["https://openalex.org/I1304085615"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":22.2599,"has_fulltext":false,"cited_by_count":111,"citation_normalized_percentile":{"value":0.9958368,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"59","last_page":"64"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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.7921034097671509},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7747368812561035},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6687986850738525},{"id":"https://openalex.org/keywords/b-tree","display_name":"B-tree","score":0.6332539319992065},{"id":"https://openalex.org/keywords/pipeline","display_name":"Pipeline (software)","score":0.6131433248519897},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.6038759350776672},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5535385012626648},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5414630770683289},{"id":"https://openalex.org/keywords/hypercube","display_name":"Hypercube","score":0.5407974123954773},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.5176361203193665},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4949631094932556},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.46128883957862854},{"id":"https://openalex.org/keywords/tracing","display_name":"Tracing","score":0.42698413133621216},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.4150370657444},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37802308797836304},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.34904244542121887},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1624850034713745},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.10954537987709045}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.7921034097671509},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7747368812561035},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6687986850738525},{"id":"https://openalex.org/C78669399","wikidata":"https://www.wikidata.org/wiki/Q677051","display_name":"B-tree","level":3,"score":0.6332539319992065},{"id":"https://openalex.org/C43521106","wikidata":"https://www.wikidata.org/wiki/Q2165493","display_name":"Pipeline (software)","level":2,"score":0.6131433248519897},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.6038759350776672},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5535385012626648},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5414630770683289},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.5407974123954773},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.5176361203193665},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4949631094932556},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.46128883957862854},{"id":"https://openalex.org/C138673069","wikidata":"https://www.wikidata.org/wiki/Q322229","display_name":"Tracing","level":2,"score":0.42698413133621216},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.4150370657444},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37802308797836304},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.34904244542121887},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1624850034713745},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.10954537987709045},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2018323.2018333","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2018323.2018333","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM SIGGRAPH Symposium on High Performance Graphics","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W782826972","https://openalex.org/W1575955136","https://openalex.org/W1991777702","https://openalex.org/W1992446696","https://openalex.org/W2011119863","https://openalex.org/W2017086619","https://openalex.org/W2028499920","https://openalex.org/W2030318194","https://openalex.org/W2072938529","https://openalex.org/W2082535145","https://openalex.org/W2101746450","https://openalex.org/W2105824580","https://openalex.org/W2120934608","https://openalex.org/W2137706341","https://openalex.org/W2142497692","https://openalex.org/W2153226019","https://openalex.org/W2159098132","https://openalex.org/W2532040979","https://openalex.org/W3138798301"],"related_works":["https://openalex.org/W151008969","https://openalex.org/W1937416524","https://openalex.org/W2355273608","https://openalex.org/W2365019162","https://openalex.org/W2393783510","https://openalex.org/W2403884748","https://openalex.org/W2105195194","https://openalex.org/W2371680642","https://openalex.org/W1560383649","https://openalex.org/W1587123803"],"abstract_inverted_index":{"A":[0],"recently":[1],"developed":[2],"algorithm":[3,85],"called":[4],"Hierachical":[5],"Linear":[6],"Bounding":[7],"Volume":[8],"Hierarchies":[9],"(HLBVH)":[10],"has":[11,66,109],"demonstrated":[12],"the":[13,17,28,50,94,106,114,117,123,128,131],"feasibility":[14],"of":[15,30,32,46,53,76,99,116,138],"reconstructing":[16],"spatial":[18,64],"index":[19],"needed":[20,62],"for":[21,63,96,102],"ray":[22],"tracing":[23],"in":[24,27],"real-time,":[25],"even":[26],"presence":[29],"millions":[31],"fully":[33],"dynamic":[34],"triangles.":[35],"In":[36],"this":[37],"work":[38,78],"we":[39],"present":[40],"a":[41,136],"simpler":[42],"and":[43,57,80,89],"faster":[44,88],"variant":[45],"HLBVH,":[47],"where":[48],"all":[49],"complex":[51],"book-keeping":[52],"prefix":[54],"sums,":[55],"compaction":[56],"partial":[58],"breadth-first":[59],"tree":[60,121],"traversal":[61],"partitioning":[65],"been":[67,110],"replaced":[68],"with":[69],"an":[70],"elegant":[71],"pipeline":[72,108],"built":[73],"on":[74,122],"top":[75],"efficient":[77],"queues":[79],"binary":[81],"search.":[82],"The":[83],"new":[84],"is":[86],"both":[87],"more":[90],"memory":[91],"efficient,":[92],"removing":[93],"need":[95],"temporary":[97],"storage":[98],"geometry":[100],"data":[101],"intermediate":[103],"computations.":[104],"Finally,":[105],"same":[107],"extended":[111],"to":[112,127,140],"parallelize":[113],"construction":[115,133],"top-level":[118],"SAH":[119],"optimized":[120],"GPU,":[124],"eliminating":[125],"round-trips":[126],"CPU,":[129],"accelerating":[130],"overall":[132],"speed":[134],"by":[135],"factor":[137],"5":[139],"10x.":[141]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":14},{"year":2015,"cited_by_count":17},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":8}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}