{"id":"https://openalex.org/W6888779261","doi":"https://doi.org/10.2312/eggh/eggh06/067-077","title":"B-KD Trees for Hardware Accelerated Ray Tracing of Dynamic Scenes","display_name":"B-KD Trees for Hardware Accelerated Ray Tracing of Dynamic Scenes","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W6888779261","doi":"https://doi.org/10.2312/eggh/eggh06/067-077"},"language":"en","primary_location":{"id":"doi:10.2312/eggh/eggh06/067-077","is_oa":true,"landing_page_url":"https://doi.org/10.2312/eggh/eggh06/067-077","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/eggh06/067-077","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Woop, Sven","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Woop, Sven","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Marmitt, Gerd","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marmitt, Gerd","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Slusallek, Philipp","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Slusallek, Philipp","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":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.7141000032424927},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.5497999787330627},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4952000081539154},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.48840001225471497},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.46630001068115234},{"id":"https://openalex.org/keywords/tracing","display_name":"Tracing","score":0.4648999869823456},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.46050000190734863},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.4228000044822693},{"id":"https://openalex.org/keywords/bounding-volume","display_name":"Bounding volume","score":0.40799999237060547}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.7141000032424927},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6617000102996826},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.5497999787330627},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4952000081539154},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.48840001225471497},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.46630001068115234},{"id":"https://openalex.org/C138673069","wikidata":"https://www.wikidata.org/wiki/Q322229","display_name":"Tracing","level":2,"score":0.4648999869823456},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.46050000190734863},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.4228000044822693},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.4115999937057495},{"id":"https://openalex.org/C184585634","wikidata":"https://www.wikidata.org/wiki/Q1434060","display_name":"Bounding volume","level":4,"score":0.40799999237060547},{"id":"https://openalex.org/C121483023","wikidata":"https://www.wikidata.org/wiki/Q7298343","display_name":"Ray tracing (physics)","level":2,"score":0.40450000762939453},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.38029998540878296},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3684000074863434},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3499000072479248},{"id":"https://openalex.org/C159620131","wikidata":"https://www.wikidata.org/wiki/Q1938983","display_name":"Spatial analysis","level":2,"score":0.29760000109672546},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.2971000075340271},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29179999232292175},{"id":"https://openalex.org/C18945957","wikidata":"https://www.wikidata.org/wiki/Q5597193","display_name":"Graphics hardware","level":3,"score":0.28760001063346863},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.2777999937534332},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.2687999904155731},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.26499998569488525},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2619999945163727},{"id":"https://openalex.org/C65232700","wikidata":"https://www.wikidata.org/wiki/Q5656403","display_name":"Hardware architecture","level":3,"score":0.2612000107765198},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.2540000081062317},{"id":"https://openalex.org/C160633673","wikidata":"https://www.wikidata.org/wiki/Q355198","display_name":"Pixel","level":2,"score":0.25220000743865967}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2312/eggh/eggh06/067-077","is_oa":true,"landing_page_url":"https://doi.org/10.2312/eggh/eggh06/067-077","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/eggh06/067-077","is_oa":true,"landing_page_url":"https://doi.org/10.2312/eggh/eggh06/067-077","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":[{"display_name":"Sustainable cities and communities","score":0.4356164336204529,"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":{"This":[0,166],"paper":[1],"introduces":[2],"a":[3,36,58,75,97,104,137],"new":[4],"spatial":[5,46,60,80,99],"index":[6,47,61,81],"structure,":[7],"called":[8],"Bounded":[9],"KD":[10,68,85,164],"tree":[11,30],"(B-KD":[12],"tree),":[13],"for":[14,52,144,170],"realtime":[15,38,214],"ray":[16,39,198],"tracing":[17,40,199],"of":[18,25,35,67,103,123,131,200,209,216],"dynamic":[19,171,179,201],"scenes.":[20],"By":[21],"presenting":[22],"hardware":[23,53,160,186],"units":[24,191],"all":[26],"time":[27],"critical":[28],"B-KD":[29,55,87,118,141,204],"algorithms":[31],"in":[32,117],"the":[33,65,129,154,168],"context":[34],"custom":[37],"chip":[41],"we":[42],"show":[43],"that":[44,63,108,127,192],"this":[45,210],"structure":[48,62],"is":[49],"well":[50],"suited":[51],"implementation.":[54],"trees":[56,69,88,91,119,142],"are":[57,89],"hybrid":[59],"combine":[64],"advantages":[66],"and":[70,146,158,177,197],"Bounding":[71],"Volume":[72],"Hierarchies":[73],"into":[74,111],"single,":[76],"simple":[77,145,159],"to":[78,84,218],"handle":[79,194],"structure.":[82],"Similar":[83],"trees,":[86],"binary":[90],"where":[92],"each":[93,115],"node":[94,116],"considers":[95],"only":[96,227],"single":[98,105],"dimension.":[100],"However,":[101],"instead":[102],"splitting":[106],"plane":[107],"divides":[109],"space":[110],"two":[112,121,133],"disjoint":[113],"sub-spaces,":[114],"contains":[120,188],"pairs":[122],"axis":[124],"aligned":[125],"planes":[126],"bound":[128],"geometry":[130,151],"its":[132],"child":[134],"nodes.":[135],"As":[136],"bounding":[138],"volume":[139],"approach":[140],"allow":[143],"efficient":[147],"updates":[148],"when":[149,224],"changing":[150],"while":[152],"maintaining":[153],"fast":[155],"traversal":[156],"operations":[157],"implementation":[161],"known":[162],"from":[163],"trees.":[165,205],"enables":[167],"support":[169],"scenes":[172,202],"with":[173],"constant":[174],"mesh":[175],"topology":[176],"coherent":[178],"changes,":[180],"like":[181],"typical":[182],"skinned":[183],"meshes.":[184],"Our":[185],"architecture":[187,211],"several":[189],"fixed-function":[190],"completely":[193],"skinning,":[195],"updating,":[196],"using":[203],"An":[206],"FPGA":[207],"prototype":[208],"already":[212],"delivers":[213],"performance":[215],"up":[217],"35":[219],"frames":[220],"per":[221],"second":[222],"even":[223],"clocked":[225],"at":[226],"66":[228],"MHz.":[229]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2025-10-10T00:00:00"}