{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T13:55:38Z","timestamp":1761486938782},"reference-count":0,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2008,10,9]],"date-time":"2008-10-09T00:00:00Z","timestamp":1223510400000},"content-version":"vor","delay-in-days":5487,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Computer Graphics Forum"],"published-print":{"date-parts":[[1993,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>An algorithm is presented which finds the first intersection of a directed semi\u2010infinite straight\u2010line (called ray) with an octree, without resorting to the evaluation of neighbouring nodes. Given a pointer\u2010based region octree, intersections of the ray with a node's bisecting planes are first evaluated to determine in which sub\u2010octants the ray\u2010node intersections may lie; a local ordering then determines the sequence in which these sub\u2010octants should be examined so that the intersection closest to the ray's origin can be selected.<\/jats:p><jats:p>This idea is applied recursively starting from the root of the octree; the novelty of the approach consists of the fact that the choice of each node's child in the octree is <jats:bold>directly<\/jats:bold> derived from the intersection of the ray\u2010segment within the tested sub\u2010octant, thus avoiding searching for any neighbouring nodes. The problem of selecting the correct octant while using the commonly available floating\u2010point arithmetic is also addressed in a ray tracing environment. Comparisons of this approach with the method given by Samet<jats:sup>17<\/jats:sup> are carried out in a variety of cases involving millions of voxels. The improvement ranged from 32% to 62% in terms of execution time.<\/jats:p>","DOI":"10.1111\/1467-8659.1240199","type":"journal-article","created":{"date-parts":[[2003,3,11]],"date-time":"2003-03-11T11:31:53Z","timestamp":1047382313000},"page":"199-210","update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Ray Tracing an Octree: Numerical Evaluation of the First Intersection"],"prefix":"10.1111","volume":"12","author":[{"given":"I.","family":"Gargantini","sequence":"first","affiliation":[]},{"given":"H. H.","family":"Atkinson","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2008,10,9]]},"container-title":["Computer Graphics Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1111%2F1467-8659.1240199","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1111\/1467-8659.1240199","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T10:30:17Z","timestamp":1698229817000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1111\/1467-8659.1240199"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,10]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,10]]}},"alternative-id":["10.1111\/1467-8659.1240199"],"URL":"https:\/\/doi.org\/10.1111\/1467-8659.1240199","archive":["Portico"],"relation":{},"ISSN":["0167-7055","1467-8659"],"issn-type":[{"value":"0167-7055","type":"print"},{"value":"1467-8659","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,10]]},"assertion":[{"value":"2008-10-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}