{"id":"https://openalex.org/W6907444003","doi":"https://doi.org/10.2312/eggh/hpg10/077-086","title":"Parallel SAH k-D Tree Construction","display_name":"Parallel SAH k-D Tree Construction","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W6907444003","doi":"https://doi.org/10.2312/eggh/hpg10/077-086"},"language":"en","primary_location":{"id":"doi:10.2312/eggh/hpg10/077-086","is_oa":true,"landing_page_url":"https://doi.org/10.2312/eggh/hpg10/077-086","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":"article"},"type":"other","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.2312/eggh/hpg10/077-086","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Choi, Byn","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Choi, Byn","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Komuravelli, Rakesh","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Komuravelli, Rakesh","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Lu, Victor","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lu, Victor","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Sung, Hyojin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sung, Hyojin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Bocchino, Robert L.","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bocchino, Robert L.","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Adve, Sarita V.","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Adve, Sarita V.","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Hart, John C.","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hart, John C.","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":7,"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":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/rendering","display_name":"Rendering (computer graphics)","score":0.739300012588501},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6942999958992004},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.511900007724762},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.4415000081062317},{"id":"https://openalex.org/keywords/k-d-tree","display_name":"k-d tree","score":0.4300999939441681},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.40470001101493835},{"id":"https://openalex.org/keywords/multi-core-processor","display_name":"Multi-core processor","score":0.4000999927520752},{"id":"https://openalex.org/keywords/ray-tracing","display_name":"Ray tracing (physics)","score":0.39010000228881836},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.37929999828338623}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7926999926567078},{"id":"https://openalex.org/C205711294","wikidata":"https://www.wikidata.org/wiki/Q176953","display_name":"Rendering (computer graphics)","level":2,"score":0.739300012588501},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6942999958992004},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.511900007724762},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.49720001220703125},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.4415000081062317},{"id":"https://openalex.org/C33721204","wikidata":"https://www.wikidata.org/wiki/Q309949","display_name":"k-d tree","level":3,"score":0.4300999939441681},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.40470001101493835},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.4000999927520752},{"id":"https://openalex.org/C121483023","wikidata":"https://www.wikidata.org/wiki/Q7298343","display_name":"Ray tracing (physics)","level":2,"score":0.39010000228881836},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.37929999828338623},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36880001425743103},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.3686999976634979},{"id":"https://openalex.org/C138673069","wikidata":"https://www.wikidata.org/wiki/Q322229","display_name":"Tracing","level":2,"score":0.36730000376701355},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.3517000079154968},{"id":"https://openalex.org/C106278948","wikidata":"https://www.wikidata.org/wiki/Q1198051","display_name":"R-tree","level":4,"score":0.33719998598098755},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.33239999413490295},{"id":"https://openalex.org/C11644782","wikidata":"https://www.wikidata.org/wiki/Q15401790","display_name":"Cost efficiency","level":2,"score":0.32409998774528503},{"id":"https://openalex.org/C36816356","wikidata":"https://www.wikidata.org/wiki/Q16911860","display_name":"3D rendering","level":3,"score":0.31060001254081726},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.3034999966621399},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29910001158714294},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.2689000070095062},{"id":"https://openalex.org/C163736687","wikidata":"https://www.wikidata.org/wiki/Q17014592","display_name":"Fractal tree index","level":5,"score":0.2687000036239624},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2644999921321869},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.26409998536109924},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.260699987411499}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2312/eggh/hpg10/077-086","is_oa":true,"landing_page_url":"https://doi.org/10.2312/eggh/hpg10/077-086","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":"article"}],"best_oa_location":{"id":"doi:10.2312/eggh/hpg10/077-086","is_oa":true,"landing_page_url":"https://doi.org/10.2312/eggh/hpg10/077-086","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":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,33,148],"k-D":[1,36,68,101,116,135,174],"tree":[2,37,69,102,160,175],"is":[3,13,65,77],"a":[4,19,47,62],"well-studied":[5],"acceleration":[6],"data":[7],"structure":[8],"for":[9,79,83,131,172],"ray":[10,59],"tracing.":[11],"It":[12],"used":[14],"to":[15,21,152],"organize":[16],"primitives":[17],"in":[18],"scene":[20],"allow":[22],"efficient":[23],"execution":[24],"of":[25,108],"intersection":[26],"operations":[27],"between":[28,140],"rays":[29],"and":[30,145,162],"the":[31,53,67,106,141,166],"primitives.":[32],"highest":[34],"quality":[35,55,161],"can":[38],"be":[39],"obtained":[40],"using":[41],"greedy":[42],"cost":[43,76],"optimization":[44],"based":[45],"on":[46,88,98,155],"surface":[48],"area":[49],"heuristc":[50],"(SAH).":[51],"While":[52],"high":[54],"enables":[56],"very":[57],"fast":[58],"tracing":[60],"times,":[61],"key":[63],"drawback":[64],"that":[66,118],"construction":[70,103],"time":[71],"remains":[72],"prohibitively":[73],"expensive.":[74],"This":[75],"unreasonable":[78],"rendering":[80,120,163],"dynamic":[81],"scenes":[82],"future":[84],"visual":[85],"computing":[86],"applications":[87],"emerging":[89],"multicore":[90],"systems.":[91],"Much":[92],"work":[93,143],"has":[94],"therefore":[95],"been":[96],"focused":[97],"faster":[99],"parallel":[100,129,146],"performance":[104],"at":[105],"expense":[107],"approximating":[109],"or":[110],"ignoring":[111],"SAH":[112],"computation,":[113],"which":[114],"produces":[115],"trees":[117],"degrade":[119],"time.":[121],"In":[122],"this":[123],"paper,":[124],"we":[125],"present":[126],"two":[127],"new":[128],"algorithms":[130,149],"building":[132],"precise":[133],"SAH-optimized":[134],"trees,":[136],"with":[137],"different":[138],"tradeoffs":[139],"total":[142],"done":[144],"scalability.":[147],"achieve":[150],"up":[151],"8x":[153],"speedup":[154],"32":[156],"cores,":[157],"without":[158],"degrading":[159],"time,":[164],"yielding":[165],"best":[167],"reported":[168],"speedups":[169],"so":[170],"far":[171],"precise-SAH":[173],"construction.":[176]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}