{"id":"https://openalex.org/W6888866778","doi":"https://doi.org/10.2312/eggh/hpg12/033-037","title":"Maximizing Parallelism in the Construction of BVHs, Octrees, and k-d Trees","display_name":"Maximizing Parallelism in the Construction of BVHs, Octrees, and k-d Trees","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W6888866778","doi":"https://doi.org/10.2312/eggh/hpg12/033-037"},"language":"en","primary_location":{"id":"doi:10.2312/eggh/hpg12/033-037","is_oa":true,"landing_page_url":"https://doi.org/10.2312/eggh/hpg12/033-037","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":null,"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/eggh/hpg12/033-037","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Karras, Tero","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Karras, Tero","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":27,"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":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.6269999742507935},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6097000241279602},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.5810999870300293},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5582000017166138},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.5547000169754028},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5320000052452087},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.4456999897956848}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7401999831199646},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.6269999742507935},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6097000241279602},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.5810999870300293},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5582000017166138},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5547000169754028},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5320000052452087},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4742000102996826},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.461899995803833},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.4456999897956848},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3917999863624573},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3208000063896179},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.30070000886917114},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.29019999504089355},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2750999927520752},{"id":"https://openalex.org/C20556612","wikidata":"https://www.wikidata.org/wiki/Q4469374","display_name":"Volume (thermodynamics)","level":2,"score":0.27230000495910645},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.25450000166893005},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.25119999051094055}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2312/eggh/hpg12/033-037","is_oa":true,"landing_page_url":"https://doi.org/10.2312/eggh/hpg12/033-037","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":null,"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/eggh/hpg12/033-037","is_oa":true,"landing_page_url":"https://doi.org/10.2312/eggh/hpg12/033-037","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":null,"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":[{"score":0.6597731709480286,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0,27],"number":[1],"of":[2,20,38,46,89],"methods":[3,32],"for":[4,74,86],"constructing":[5,61,75],"bounding":[6],"volume":[7],"hierarchies":[8],"and":[9],"point-based":[10],"octrees":[11],"on":[12,17],"the":[13,18,39,44,62],"GPU":[14],"are":[15],"based":[16],"idea":[19],"ordering":[21],"primitives":[22],"along":[23],"a":[24,54,83],"space-filling":[25],"curve.":[26],"major":[28],"shortcoming":[29],"with":[30],"these":[31],"is":[33,70],"that":[34,48,57],"they":[35,49],"construct":[36],"levels":[37],"tree":[40,64],"sequentially,":[41],"which":[42,79],"limits":[43],"amount":[45],"parallelism":[47],"can":[50],"achieve.":[51],"We":[52],"present":[53],"novel":[55],"approach":[56],"improves":[58],"scalability":[59],"by":[60],"entire":[63],"in":[65],"parallel.":[66],"Our":[67],"main":[68],"contribution":[69],"an":[71],"in-place":[72],"algorithm":[73],"binary":[76],"radix":[77],"trees,":[78],"we":[80],"use":[81],"as":[82],"building":[84],"block":[85],"other":[87],"types":[88],"trees.":[90]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}