Monte-Carlo ray tracing for axisymmetrical optical elements
E.S. Andreev, M.A. Moiseev, K.V. Borisova, L.L. Doskolovich

 

Image Processing Systems Institute, Russian Academy of Sciences,

Samara State Aerospace University

Full text of article: Russian language.

 PDF

Abstract:
A modification of the Monte-Carlo ray tracing procedure for axisymmetric surfaces is proposed. The main idea consists in the approximation of optical surfaces by truncated cones and the use of an unconventional k-d tree. The simulation results show high performance of the proposed method, with the ray tracing procedure working 3-12 times faster than conventional algorithms based on a triangle approximation.

Keywords:
Monte-Carlo ray tracing, path tracing, geometric optics, computation methods, systems with special symmetry.

Citation:
Andreev ES, Moiseev MA, Borisova KV, Doskolovich LL. Monte-Carlo ray tracing for axisymmetrical optical elements. Computer Optics 2015; 39(3): 357-62. DOI: 10.18287/0134-2452-2015-39-3-357-362.

References:

  1. Lafortune E. Mathematical models and Monte Carlo algorithms for physically based rendering. Department of Computer Science, Faculty of Engineering, Katholieke Universiteit Leuven 1996.
  2. Hokr BH, Bixler JN, Elpers G, Zollars B, Thomas RJ, Yakovlev VV, Scully MO. Modeling focusing Gaussian beams in a turbid medium with Monte Carlo simulations. Optics Express 2015; 23(7): 8699-705.
  3. Zhdanov DD, Garbul AA, Maiorov VA, Potemin IS, Sokolov VG. Indeterminate ray tracing in problems of the analysis of light scattering and the design of illuminating systems. Journal of Optical Technology 2014; 81(6): 322-26.
  4. Boissonnat JD, Oudot S. Provably good sampling and meshing of surfaces. Graphical Models 2005; 67(5): 405-51.
  5. Rineau L, Yvinec M. A generic software design for Delaunay refinement meshing. Computational Geometry 2007; 38(1): 100-10.
  6. Möller T, Trumbore B. Fast, minimum storage ray-triangle intersection. Journal of Graphics Tools 1997; 2(1): 21-8.
  7. Meagher D. Geometric modeling using octree encoding. Computer Graphics and Image Processing 1982; 19(2): 129-47.
  8. Gunther J, Popov S, Seidel HP, Slusallek P. Realtime Ray Tracing on GPU with BVH-based Packet Traversal. Proceedings of the IEEE Symposium on Interactive Ray Tracing 2007; 1: 113-8.
  9. Bentley JL. Multidimensional binary search trees used for associative searching. Communications of the ACM 1975; 18(9): 509-17.
  10. Havran V, Kopal T, Bittner J, Zára J. Fast robust BSP tree traversal algorithm for ray tracing. Journal of Graphics Tools 1997; 2(4): 15-23.
  11. Havran V. Heuristic ray shooting algorithms. Faculty of Electrical Engineering, Czech Technical University 2000.
  12. Wald I, Havran V. On building fast kd-trees for ray tracing, and on doing that in O (N log N). Interactive Ray Tracing 2006; 1: 61-9.
  13. MacDonald JD, Booth KS. Heuristics for ray tracing using space subdivision. The Visual Computer 1990; 6(3): 153-66.
  14. Moiseev MA, Doskolovich LL, Borisova KV, Byzov EV. Fast and robust technique for design of axisymmetric TIR optics in case of an extended light source. Journal of Modern Optics 2013; 60(14): 1100-6.
  15. Kravchenko SV, Moiseev MA, Doskolovich LL, Kazanskiy NL. Design of axis-symmetrical optical element with two aspherical surfaces for generation of prescribed irradiance distribution [In Russian]. Computer Optics 2011; 35(4): 467–72.
© 2009, IPSI RAS
151, Molodogvardeiskaya str., Samara, 443001, Russia; E-mail:journal@computeroptics.ru; Tel: +7 (846) 242-41-24 (Executive secretary), +7 (846) 332-56-22 (Issuing editor), Fax: +7 (846) 332-56-20