{"id":"https://openalex.org/W6926321789","doi":"https://doi.org/10.2312/eggh/hpg10/107-111","title":"Restart Trail for Stackless BVH Traversal","display_name":"Restart Trail for Stackless BVH Traversal","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W6926321789","doi":"https://doi.org/10.2312/eggh/hpg10/107-111"},"language":"en","primary_location":{"id":"doi:10.2312/eggh/hpg10/107-111","is_oa":true,"landing_page_url":"https://doi.org/10.2312/eggh/hpg10/107-111","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/hpg10/107-111","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Laine, Samuli","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Laine, Samuli","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/T10252","display_name":"Microbial Natural Products and Biosynthesis","score":0.8598999977111816,"subfield":{"id":"https://openalex.org/subfields/2736","display_name":"Pharmacology"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},"topics":[{"id":"https://openalex.org/T10252","display_name":"Microbial Natural Products and Biosynthesis","score":0.8598999977111816,"subfield":{"id":"https://openalex.org/subfields/2736","display_name":"Pharmacology"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T12858","display_name":"Plant Disease Resistance and Genetics","score":0.009100000374019146,"subfield":{"id":"https://openalex.org/subfields/1110","display_name":"Plant Science"},"field":{"id":"https://openalex.org/fields/11","display_name":"Agricultural and Biological Sciences"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T13971","display_name":"Synthesis and Biological Activity","score":0.00800000037997961,"subfield":{"id":"https://openalex.org/subfields/1306","display_name":"Cancer Research"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.9671000242233276},{"id":"https://openalex.org/keywords/stack","display_name":"Stack (abstract data type)","score":0.7631000280380249},{"id":"https://openalex.org/keywords/call-stack","display_name":"Call stack","score":0.6324999928474426},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.5023000240325928},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.49880000948905945},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4113999903202057}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.9671000242233276},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7642999887466431},{"id":"https://openalex.org/C9395851","wikidata":"https://www.wikidata.org/wiki/Q177929","display_name":"Stack (abstract data type)","level":2,"score":0.7631000280380249},{"id":"https://openalex.org/C119024030","wikidata":"https://www.wikidata.org/wiki/Q759899","display_name":"Call stack","level":3,"score":0.6324999928474426},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.5023000240325928},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.49880000948905945},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4562000036239624},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4113999903202057},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36000001430511475},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.3075000047683716},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2904999852180481},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.29010000824928284},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.2799000144004822},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2736000120639801},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.2669999897480011},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.26350000500679016}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2312/eggh/hpg10/107-111","is_oa":true,"landing_page_url":"https://doi.org/10.2312/eggh/hpg10/107-111","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/hpg10/107-111","is_oa":true,"landing_page_url":"https://doi.org/10.2312/eggh/hpg10/107-111","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":[],"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],"ray":[1,103,110,164],"cast":[2],"algorithm":[3],"utilizing":[4],"a":[5,12,26,42,68,133,168],"hierarchical":[6],"acceleration":[7],"structure":[8],"needs":[9],"to":[10,35,48,53,118],"perform":[11],"tree":[13,96],"traversal":[14,24,82,161,174],"in":[15],"the":[16,23,30,81,90,95,113,143,173,180],"hierarchy.":[17],"In":[18,38,126],"its":[19],"basic":[20],"form,":[21],"executing":[22],"requires":[25],"stack":[27,43,60,76,160,170],"that":[28,32,80,89,137],"holds":[29],"nodes":[31],"are":[33],"still":[34],"be":[36,45,63,84],"processed.":[37],"some":[39],"cases,":[40],"such":[41,123],"can":[44,83],"prohibitively":[46],"expensive":[47],"maintain":[49],"or":[50,55,65,74,171],"access,":[51],"due":[52],"storage":[54],"memory":[56],"bandwidth":[57],"limitations.":[58],"The":[59],"can,":[61],"however,":[62],"eliminated":[64],"replaced":[66],"with":[67],"fixed-size":[69],"buffer":[70],"using":[71,167],"so-called":[72],"stackless":[73,157],"short":[75,159],"algorithms.":[77],"These":[78],"require":[79],"restarted":[85],"from":[86],"root":[87],"so":[88,177],"already":[91],"processed":[92],"part":[93],"of":[94,121,142,145,151],"is":[97,106],"not":[98,116],"entered":[99],"again.":[100],"For":[101],"kd-tree":[102],"casts,":[104,165],"this":[105,127],"accomplished":[107],"easily":[108],"by":[109,147],"shortening,":[111],"but":[112],"approach":[114],"does":[115],"extend":[117],"other":[119],"kinds":[120],"hierarchies":[122],"as":[124],"BVHs.":[125],"paper,":[128],"we":[129],"introduce":[130],"restart":[131],"trail,":[132],"simple":[134],"algorithmic":[135],"method":[136],"makes":[138],"restarts":[139],"possible":[140],"regardless":[141],"type":[144],"hierarchy":[146],"storing":[148],"one":[149],"bit":[150],"data":[152],"per":[153],"level.":[154],"This":[155],"enables":[156],"and":[158],"for":[162],"BVH":[163],"where":[166],"full":[169],"constraining":[172],"order":[175],"have":[176],"far":[178],"been":[179],"only":[181],"options.":[182]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2025-10-10T00:00:00"}