Skip to main content
SpringerLink
Log in

Using Multilevel Hash Tables to Speed up Rendering

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

In this paper, we analyze realistic rendering methods in terms of their efficiency in calculating caustic and indirect illumination. As the basic approach to realistic rendering, we choose bidirectional progressive ray tracing with backward photon maps. The main factors that reduce the efficiency of this method are analyzed. It is shown that the main factor that affects its performance is slow access to photon map data. Different techniques for construction of spatial acceleration structures are considered, their advantages and disadvantages are investigated. As the main approaches, we select the regular spatial grid and binary kd-tree. The spatial grid provides high-speed access to photon data at low adaptability of photon map partitioning. The kd-tree is characterized by high spatial adaptability of photon map partitioning but slow access to photon data. We propose a combined solution that takes advantage of the adaptability of the kd-tree and the fast data access of the spatial grid. For this purpose, the regular grid is superimposed on the kd-tree constructed based on the principle of space partitioning of a photon region into geometrically identical halves. To reduce memory consumption, we propose, first, to use multilevel spatial grids superimposed on the selected nodes of the kd-tree and, second, to store spatial grids in the form of hash tables in order to reduce the size of the acceleration structure. Thus, a spatial acceleration structure of a new type—a tree of hash tables—is proposed and implemented. For the spatial structure developed, we implement methods for finding the nearest photons the integration spheres of which cover the illumination point, as well as methods for finding the intersection between a ray segment and photon integration spheres. The proposed software solutions are implemented in the Lumicept software package; for some scenes, the proposed method is compared with the Lumicept method based on the binary tree. The comparison shows that our method can increase the overall speed of the rendering process by more than 40%.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1.
Fig. 2.
Fig. 3.
Fig. 4.
Fig. 5.
Fig. 6.
Fig. 7.

Similar content being viewed by others

REFERENCES

  1. 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. 7–48.

  2. Georgiev, I., Krivanek, J., Davidovic, T., and Slusallek, P., Light transport simulation with vertex connection and merging, ACM Trans. Graphics, 2012, vol. 31, no. 6, pp. 1–10.

    Article  Google Scholar 

  3. Veach, E. and Guibas, L.J., Metropolis light transport, Proc. 24th Annu. Conf. Computer Graphics and Interactive Techniques (SIGGRAPH), 1997, pp. 65–76. https://doi.org/10.1145/258734.258775

  4. Wenzel, J., Light transport on path-space manifolds, Ph.D. Thesis, 2013.

  5. 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

  6. Bitterli, B., Jakob, W., Novák, J., and Jarosz, W., Reversible jump metropolis light transport using inverse mappings, 2017.

  7. 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

  8. Jensen, H.W., Global illumination using photon maps, Proc. Eurographics Workshop on Rendering Techniques, 1996, pp. 21–30.

  9. Havran, V., Herzog, R., and Seidel, H.P., Final gathering via reverse photon mapping, Comput. Graphics Forum, 2005, vol. 24, no. 3, pp. 323–332.

    Article  Google Scholar 

  10. 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–12.

  11. Zhdanov, A.D. and Zhdanov, D.D., Progressive backward photon mapping, Program. Comput. Software, 2021, vol. 47, no. 3, pp. 185–193.

    Article  MathSciNet  Google Scholar 

  12. Bentley, J.L. and Friedman, J.H., Data structures for range searching, ACM Comput. Surv. (CSUR), 1979, vol. 11, no. 4, pp. 397–409.

    Article  Google Scholar 

  13. Hachisuka, T. and Jensen, H.W., Parallel progressive photon mapping on GPUs, Proc. ACM SIGGRAPH ASIA, 2010. https://doi.org/10.1145/1899950.1900004

  14. 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. 81–88.

  15. Knoll, A., A survey of octree volume rendering methods.

  16. Fabianowski, B. and Dingliana, J., Compact BVH storage for ray tracing and photon mapping.

  17. Bradshaw, G. and O’Sullivan, C., Sphere-tree construction using dynamic medial axis approximation, Proc. ACM SIGGRAPH/Eurographics Symp. Computer Animation (SCA), pp. 33–40. https://doi.org/10.1145/545261.545267

  18. van den Bergen, G., Efficient collision detection of complex deformable models using AABB trees, J. Graph. Tools, 1997, vol. 2, no. 4, pp. 1–13. https://doi.org/10.1080/10867651.1997.10487480

    Article  MATH  Google Scholar 

  19. 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–180. https://doi.org/10.1145/237170.237244

  20. Stich, M., Friedrich, H., and Dietrich, A., Spatial splits in bounding volume hierarchies, Proc. Conf. High Performance Graphics (HPG), 2009, pp. 7–13. https://doi.org/10.1145/1572769.1572771

  21. Wald, I., Günther, 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–603.

  22. 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’yuternoi grafike i zreniyu “Grafikon” (Proc. Int. Conf. Computer Graphics and Vision “Grafikon”), 2022, vol. 32, pp. 110–123.

  23. Havran, V., Heuristic ray shooting algorithms, 2000.

  24. Hapala, M. and Havran, V., Review: Kd-tree traversal algorithms for ray tracing, Comput. Graphics Forum, vol. 30, pp. 199–213. https://doi.org/10.1111/j.1467-8659.2010.01844.x

  25. Foley, T. and Sugerman, J., Kd-tree acceleration structures for a GPU raytracer, Proc. ACM SIGGRAPH/EUROGRAPHICS Conf. Graphics Hardware (HWWS), pp. 15–22. https://doi.org/10.1145/1071866.1071869

  26. Lumicept Integra. https://integra.jp/en/products/lumicept.

  27. 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–12.

    Google Scholar 

Download references

Funding

This work was supported by the Russian Science Foundation, project no. 22-11-00145.

Author information

Authors and Affiliations

  1. St. Petersburg National Research University of Information Technologies, Mechanics, and Optics (ITMO University), Kronverkskii pr. 49, 197101, St. Petersburg, Russia

    D. D. Zhdanov, A. I. Lysykh, R. R. Khalimov, I. E. Kinev & A. D. Zhdanov

Authors
  1. D. D. Zhdanov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. I. Lysykh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R. R. Khalimov
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. I. E. Kinev
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. A. D. Zhdanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to D. D. Zhdanov, A. I. Lysykh, R. R. Khalimov, I. E. Kinev or A. D. Zhdanov.

Ethics declarations

The authors declare that they have no conflicts of interest.

Additional information

Translated by Yu. Kornienko

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhdanov, D.D., Lysykh, A.I., Khalimov, R.R. et al. Using Multilevel Hash Tables to Speed up Rendering. Program Comput Soft 49, 161–171 (2023). https://doi.org/10.1134/S0361768823030076

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0361768823030076

Search

Navigation