{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:34:00Z","timestamp":1775018040935,"version":"3.50.1"},"reference-count":27,"publisher":"Pleiades Publishing Ltd","issue":"3","license":[{"start":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T00:00:00Z","timestamp":1685059200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T00:00:00Z","timestamp":1685059200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Program Comput Soft"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1134\/s0361768823030076","type":"journal-article","created":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T19:02:45Z","timestamp":1685041365000},"page":"161-171","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Using Multilevel Hash Tables to Speed up Rendering"],"prefix":"10.1134","volume":"49","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7346-8155","authenticated-orcid":false,"given":"D. D.","family":"Zhdanov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2437-5275","authenticated-orcid":false,"given":"A. I.","family":"Lysykh","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1923-4360","authenticated-orcid":false,"given":"R. R.","family":"Khalimov","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2929-1203","authenticated-orcid":false,"given":"I. E.","family":"Kinev","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2569-1982","authenticated-orcid":false,"given":"A. D.","family":"Zhdanov","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2023,5,26]]},"reference":[{"key":"3732_CR1","doi-asserted-by":"crossref","unstructured":"Frolov, V.A., Voloboi, A.G., Ershov, S.V., and Galaktionov, V.A., Current state of global illumination calculation methods in problems of realistic computer graphics, Tr. Inst. Sist. Program. Ross. Akad. Nauk (Proc. Inst. Syst. Program. Russ. Acad. Sci.), 2021, vol. 33, no. 2, pp.\u00a07\u201348.","DOI":"10.15514\/ISPRAS-2021-33(2)-1"},{"key":"3732_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2366145.2366211","volume":"31","author":"I. Georgiev","year":"2012","unstructured":"Georgiev, I., Krivanek, J., Davidovic, T., and Slusallek, P., Light transport simulation with vertex connection and merging, ACM Trans. Graphics, 2012, vol.\u00a031, no. 6, pp. 1\u201310.","journal-title":"ACM Trans. Graphics"},{"key":"3732_CR3","doi-asserted-by":"publisher","unstructured":"Veach, E. and Guibas, L.J., Metropolis light transport, Proc. 24th Annu. Conf. Computer Graphics and Interactive Techniques (SIGGRAPH), 1997, pp. 65\u201376. https:\/\/doi.org\/10.1145\/258734.258775","DOI":"10.1145\/258734.258775"},{"key":"3732_CR4","unstructured":"Wenzel, J., Light transport on path-space manifolds, Ph.D. Thesis, 2013."},{"key":"3732_CR5","doi-asserted-by":"publisher","unstructured":"Kaplanyan, A.S., Hanika, J., and Dachsbacher, C., The natural-constraint representation of the path space for efficient light transport simulation, ACM Trans. Graphics, 2014, vol. 33. https:\/\/doi.org\/10.1145\/2601097.2601108","DOI":"10.1145\/2601097.2601108"},{"key":"3732_CR6","doi-asserted-by":"crossref","unstructured":"Bitterli, B., Jakob, W., Nov\u00e1k, J., and Jarosz, W., Reversible jump metropolis light transport using inverse mappings, 2017.","DOI":"10.1145\/3132704"},{"key":"3732_CR7","doi-asserted-by":"publisher","unstructured":"Gruson, A., West, R., and Hachisuka, T., Stratified Markov chain Monte Carlo light transport, Comput. Graphics Forum, 2020. https:\/\/doi.org\/10.1111\/cgf.13935","DOI":"10.1111\/cgf.13935"},{"key":"3732_CR8","doi-asserted-by":"crossref","unstructured":"Jensen, H.W., Global illumination using photon maps, Proc. Eurographics Workshop on Rendering Techniques, 1996, pp. 21\u201330.","DOI":"10.1007\/978-3-7091-7484-5_3"},{"key":"3732_CR9","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1111\/j.1467-8659.2005.00857.x","volume":"24","author":"V. Havran","year":"2005","unstructured":"Havran, V., Herzog, R., and Seidel, H.P., Final gathering via reverse photon mapping, Comput. Graphics Forum, 2005, vol. 24, no. 3, pp. 323\u2013332.","journal-title":"Comput. Graphics Forum"},{"key":"3732_CR10","doi-asserted-by":"crossref","unstructured":"Zhdanov, A. and Zhdanov, D., The backward photon mapping for the realistic image rendering, Proc. 30th Conf. Computer Graphics and Machine Vision (GraphiCon), 2020, vol. 2744, pp. 1\u201312.","DOI":"10.51130\/graphicon-2020-2-3-8"},{"key":"3732_CR11","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1134\/S0361768821030117","volume":"47","author":"A.D. Zhdanov","year":"2021","unstructured":"Zhdanov, A.D. and Zhdanov, D.D., Progressive backward photon mapping, Program. Comput. Software, 2021, vol. 47, no. 3, pp. 185\u2013193.","journal-title":"Program. Comput. Software"},{"key":"3732_CR12","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1145\/356789.356797","volume":"11","author":"J.L. Bentley","year":"1979","unstructured":"Bentley, J.L. and Friedman, J.H., Data structures for range searching, ACM Comput. Surv. \n               (CSUR), 1979, vol. 11, no. 4, pp. 397\u2013409.","journal-title":"ACM Comput. Surv."},{"key":"3732_CR13","doi-asserted-by":"publisher","unstructured":"Hachisuka, T. and Jensen, H.W., Parallel progressive photon mapping on GPUs, Proc. ACM SIGGRAPH ASIA, 2010. https:\/\/doi.org\/10.1145\/1899950.1900004","DOI":"10.1145\/1899950.1900004"},{"key":"3732_CR14","doi-asserted-by":"crossref","unstructured":"Hunt, W., Mark, W.R., and Stoll, G., Fast kd-tree construction with an adaptive error-bounded heuristic, Proc. IEEE Symp. Interactive Ray Tracing, 2006, pp.\u00a081\u201388.","DOI":"10.1109\/RT.2006.280218"},{"key":"3732_CR15","unstructured":"Knoll, A., A survey of octree volume rendering methods."},{"key":"3732_CR16","unstructured":"Fabianowski, B. and Dingliana, J., Compact BVH storage for ray tracing and photon mapping."},{"key":"3732_CR17","doi-asserted-by":"publisher","unstructured":"Bradshaw, G. and O\u2019Sullivan, C., Sphere-tree construction using dynamic medial axis approximation, Proc. ACM SIGGRAPH\/Eurographics Symp. Computer Animation (SCA), pp. 33\u201340. https:\/\/doi.org\/10.1145\/545261.545267","DOI":"10.1145\/545261.545267"},{"key":"3732_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/10867651.1997.10487480","volume":"2","author":"G. van den Bergen","year":"1997","unstructured":"van den Bergen, G., Efficient collision detection of complex deformable models using AABB trees, J. Graph. Tools, 1997, vol. 2, no. 4, pp. 1\u201313. https:\/\/doi.org\/10.1080\/10867651.1997.10487480","journal-title":"J. Graph. Tools"},{"key":"3732_CR19","doi-asserted-by":"publisher","unstructured":"Gottschalk, S., Lin, M.C., and Manocha, D., OBBTree: A hierarchical structure for rapid interference detection, Proc. 23rd Annu. Conf. Computer Graphics and Interactive Techniques (SIGGRAPH), 1996, pp. 171\u2013180. https:\/\/doi.org\/10.1145\/237170.237244","DOI":"10.1145\/237170.237244"},{"key":"3732_CR20","doi-asserted-by":"publisher","unstructured":"Stich, M., Friedrich, H., and Dietrich, A., Spatial splits in bounding volume hierarchies, Proc. Conf. High Performance Graphics (HPG), 2009, pp. 7\u201313. https:\/\/doi.org\/10.1145\/1572769.1572771","DOI":"10.1145\/1572769.1572771"},{"key":"3732_CR21","doi-asserted-by":"crossref","unstructured":"Wald, I., G\u00fcnther, J., Slusallek, Ph., Cani, M.-P., and Slater, M., Balancing considered harmful: Faster photon mapping using the voxel volume heuristic, Proc. 25th Annu. Conf. European Association for Computer Graphics (EUROGRAPHICS), 2004, pp. 595\u2013603.","DOI":"10.1111\/j.1467-8659.2004.00791.x"},{"key":"3732_CR22","doi-asserted-by":"crossref","unstructured":"Khalimov, R.R., Zhdanov, D.D., and Zhdanov, A.D., Formation of an efficient spatial structure of photon maps to speed up the rendering process, Trudy Mezhdunarodnoi Konferentsii po komp\u2019yuternoi grafike i zreniyu \u201cGrafikon\u201d (Proc. Int. Conf. Computer Graphics and Vision \u201cGrafikon\u201d), 2022, vol. 32, pp. 110\u2013123.","DOI":"10.20948\/graphicon-2022-110-123"},{"key":"3732_CR23","unstructured":"Havran, V., Heuristic ray shooting algorithms, 2000."},{"key":"3732_CR24","doi-asserted-by":"publisher","unstructured":"Hapala, M. and Havran, V., Review: Kd-tree traversal algorithms for ray tracing, Comput. Graphics Forum, vol. 30, pp. 199\u2013213. https:\/\/doi.org\/10.1111\/j.1467-8659.2010.01844.x","DOI":"10.1111\/j.1467-8659.2010.01844.x"},{"key":"3732_CR25","doi-asserted-by":"publisher","unstructured":"Foley, T. and Sugerman, J., Kd-tree acceleration structures for a GPU raytracer, Proc. ACM SIGGRAPH\/EUROGRAPHICS Conf. Graphics Hardware (HWWS), pp.\u00a015\u201322. https:\/\/doi.org\/10.1145\/1071866.1071869","DOI":"10.1145\/1071866.1071869"},{"key":"3732_CR26","unstructured":"Lumicept Integra. https:\/\/integra.jp\/en\/products\/lumicept."},{"key":"3732_CR27","first-page":"1","volume":"2744","author":"A.D. Zhdanov","year":"2020","unstructured":"Zhdanov, A.D. and Zhdanov, D.D., The two-level semi-synchronous parallelization method for the caustic and indirect luminance calculation in realistic rendering, CEUR Workshop Proc., 2020, vol. 2744, pp. 1\u201312.","journal-title":"CEUR Workshop Proc."}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768823030076.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0361768823030076","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768823030076.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:49:30Z","timestamp":1775011770000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0361768823030076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,26]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["3732"],"URL":"https:\/\/doi.org\/10.1134\/s0361768823030076","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,26]]},"assertion":[{"value":"10 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"CONFLICT OF INTEREST"}}]}}