{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T02:13:09Z","timestamp":1774059189410,"version":"3.50.1"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2011,10,1]],"date-time":"2011-10-01T00:00:00Z","timestamp":1317427200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/E001750\/1EP\/I005870\/1"],"award-info":[{"award-number":["EP\/E001750\/1EP\/I005870\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2011,10]]},"abstract":"<jats:p>We present an efficient ray-tracing algorithm which, for the first time, does not store any data structures when performing spatial subdivisions, and directly computes intersections inside the scene. This new algorithm is often faster than comparable ray-tracing methods at rendering dynamic scenes, and has a similar level of performance when compared to static ray-tracers. Memory management is made minimal and deterministic, which simplifies ray-tracing engineering, as spatial subdivision data structures are no longer considered in the graphics pipeline. This is possible with a modification of Whitted's naive ray-tracing algorithm by using a divide-and-conquer approach, and by having a sufficient collection of rays in order to reduce the complexity of naive ray-tracing. In particular, the algorithm excels at spontaneously solving large Ray\/Primitive intersection problems.<\/jats:p>","DOI":"10.1145\/2019627.2019636","type":"journal-article","created":{"date-parts":[[2011,10,25]],"date-time":"2011-10-25T12:23:05Z","timestamp":1319545385000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Naive ray-tracing"],"prefix":"10.1145","volume":"30","author":[{"given":"Benjamin","family":"Mora","sequence":"first","affiliation":[{"name":"Swansea University, Swansea, UK"}]}],"member":"320","published-online":{"date-parts":[[2011,10,22]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1080\/10867651.2001.10487535"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/800031.808589"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01905559"},{"key":"e_1_2_2_5_1","unstructured":"Eberly D. 2000. Intersection of a line and a cone. http:\/\/www. geometrictools.com\/Documentation\/IntersectionLineCone.pdf  Eberly D. 2000. Intersection of a line and a cone. http:\/\/www. geometrictools.com\/Documentation\/IntersectionLineCone.pdf"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/800250.807481"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCG.1986.276715"},{"key":"e_1_2_2_8_1","volume-title":"Proceedings of Eurographics. 289--298","author":"Garanzha K.","unstructured":"Garanzha , K. and Loop , C . 2010. Fast ray sorting and breadth-first packet traversal for GPU ray tracing . In Proceedings of Eurographics. 289--298 . Garanzha, K. and Loop, C. 2010. Fast ray sorting and breadth-first packet traversal for GPU ray tracing. In Proceedings of Eurographics. 289--298."},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCG.1984.6429331"},{"key":"e_1_2_2_10_1","volume-title":"Proceedings of the IEEE Symposium on Interactive Ray Tracing. 59--66","author":"Gribble C. P.","unstructured":"Gribble , C. P. and Ramani , K . 2008. Coherent ray tracing via stream filtering . In Proceedings of the IEEE Symposium on Interactive Ray Tracing. 59--66 . Gribble, C. P. and Ramani, K. 2008. Coherent ray tracing via stream filtering. In Proceedings of the IEEE Symposium on Interactive Ray Tracing. 59--66."},{"key":"e_1_2_2_11_1","volume-title":"Proceedings of the IEEE Symposium on Raytracing. 71--80","author":"Havran","unstructured":"Havran ., V., Herzog , R. , and Seidel H . -P. 2006. On the fast construction of spatial hierarchies for ray tracing . In Proceedings of the IEEE Symposium on Raytracing. 71--80 . Havran., V., Herzog, R., and Seidel H.-P. 2006. On the fast construction of spatial hierarchies for ray tracing. In Proceedings of the IEEE Symposium on Raytracing. 71--80."},{"key":"e_1_2_2_12_1","volume-title":"Proceedings of the IEEE Symposium on Raytracing. 81--88","author":"Hunt W.","unstructured":"Hunt , W. , Mark , W. R. and Stoll , G . 2006. Fast kd-tree construction with an adaptive error-bounded heuristic . In Proceedings of the IEEE Symposium on Raytracing. 81--88 . Hunt, W., Mark, W. R. and Stoll, G. 2006. Fast kd-tree construction with an adaptive error-bounded heuristic. In Proceedings of the IEEE Symposium on Raytracing. 81--88."},{"key":"e_1_2_2_13_1","volume-title":"Proceedings of the IEEE\/EG Symposium on Raytracing. 3--10","author":"Hunt W.","unstructured":"Hunt , W. , and Mark , W. R . 2008a. Ray-Specialized acceleration structures for ray tracing . In Proceedings of the IEEE\/EG Symposium on Raytracing. 3--10 . Hunt, W., and Mark, W. R. 2008a. Ray-Specialized acceleration structures for ray tracing. In Proceedings of the IEEE\/EG Symposium on Raytracing. 3--10."},{"key":"e_1_2_2_14_1","volume-title":"Proceedings of the IEEE\/EG Symposium on Raytracing. 11--17","author":"Hunt W.","unstructured":"Hunt , W. , and Mark , W. R . 2008b. Adaptive acceleration structures in perspective space . In Proceedings of the IEEE\/EG Symposium on Raytracing. 11--17 . Hunt, W., and Mark, W. R. 2008b. Adaptive acceleration structures in perspective space. In Proceedings of the IEEE\/EG Symposium on Raytracing. 11--17."},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/RT.2007.4342587"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/383259.383319"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/15922.15902"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/15922.15916"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/258734.258769"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2008.01262.x"},{"key":"e_1_2_2_21_1","volume-title":"Proceedings of the IEEE Symposium on Interactive Ray Tracing. 39--45","author":"Lauterbach C.","unstructured":"Lauterbach , C. , Yoon , S. and Manocha , D . 2006. RT-DEFORM: Interactive ray tracing of dynamic scenes using BVHs . In Proceedings of the IEEE Symposium on Interactive Ray Tracing. 39--45 . Lauterbach, C., Yoon, S. and Manocha, D. 2006. RT-DEFORM: Interactive ray tracing of dynamic scenes using BVHs. In Proceedings of the IEEE Symposium on Interactive Ray Tracing. 39--45."},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1572769.1572783"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1080\/10867651.1997.10487468"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/2945.646235"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/2383847.2383861"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/2383847.2383862"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1186822.1073329"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/RT.2006.280215"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/800250.807479"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1058129.1058143"},{"key":"e_1_2_2_31_1","volume-title":"Proceedings of Eurographics. 395--404","author":"Shevtsov M.","unstructured":"Shevtsov , M. , Soupikov , A. and Kapustin , A . 2007. Highly parallel fast KD-tree construction for interactive ray tracing of dynamic scenes . In Proceedings of Eurographics. 395--404 . Shevtsov, M., Soupikov, A. and Kapustin, A. 2007. Highly parallel fast KD-tree construction for interactive ray tracing of dynamic scenes. In Proceedings of Eurographics. 395--404."},{"key":"e_1_2_2_32_1","volume-title":"Faster fast ray tracing techniques. Master thesis, Electrical and Computer Engineering","author":"Tsakok J. A.","unstructured":"Tsakok , J. A. 2008. Faster fast ray tracing techniques. Master thesis, Electrical and Computer Engineering . University of Waterloo . Tsakok, J. A. 2008. Faster fast ray tracing techniques. Master thesis, Electrical and Computer Engineering. University of Waterloo."},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1572769.1572793"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/2383894.2383912"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/RT.2007.4342589"},{"key":"e_1_2_2_36_1","volume-title":"Patent Applications Publication No. US 2009\/0225081 A1.","author":"W\u00e4chter C.","unstructured":"W\u00e4chter , C. and Keller , A . 2009. Efficient ray tracing without acceleration data structure. U.S . Patent Applications Publication No. US 2009\/0225081 A1. W\u00e4chter, C. and Keller, A. 2009. Efficient ray tracing without acceleration data structure. U.S. Patent Applications Publication No. US 2009\/0225081 A1."},{"key":"e_1_2_2_37_1","volume-title":"Proceedings of EUROGRAPHICS. 153--164","author":"Wald I.","unstructured":"Wald , I. , Slusallek , P. , Benthin , C. and Wagner , M . 2001. Interactive rendering with coherent ray tracing . In Proceedings of EUROGRAPHICS. 153--164 . Wald, I., Slusallek, P., Benthin, C. and Wagner, M. 2001. Interactive rendering with coherent ray tracing. In Proceedings of EUROGRAPHICS. 153--164."},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1179352.1141913"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1189762.1206075"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/RT.2007.4342588"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/358876.358882"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1409060.1409079"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2019627.2019636","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2019627.2019636","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:07:42Z","timestamp":1750273662000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2019627.2019636"}},"subtitle":["A divide-and-conquer approach"],"short-title":[],"issued":{"date-parts":[[2011,10]]},"references-count":42,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["10.1145\/2019627.2019636"],"URL":"https:\/\/doi.org\/10.1145\/2019627.2019636","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10]]},"assertion":[{"value":"2010-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-10-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}