scholarly journals RECORDS: improved Reporting of montE CarlO RaDiation transport Studies: Report of the AAPM Research Committee Task Group 268

2017 ◽  
Vol 45 (1) ◽  
pp. e1-e5 ◽  
Author(s):  
Ioannis Sechopoulos ◽  
D. W. O. Rogers ◽  
Magdalena Bazalova-Carter ◽  
Wesley E. Bolch ◽  
Emily C. Heath ◽  
...  
2018 ◽  
Vol 101 (4) ◽  
pp. 792-793
Author(s):  
Ioannis Sechopoulos ◽  
D.W.O. Rogers ◽  
Magdalena Bazalova-Carter ◽  
Wesley E. Bolch ◽  
Emily C. Heath ◽  
...  

2015 ◽  
Vol 42 (10) ◽  
pp. 5679-5691 ◽  
Author(s):  
Ioannis Sechopoulos ◽  
Elsayed S. M. Ali ◽  
Andreu Badal ◽  
Aldo Badano ◽  
John M. Boone ◽  
...  

2001 ◽  
Vol 28 (12) ◽  
pp. 2497-2506 ◽  
Author(s):  
Jong Oh Kim ◽  
Jeffrey V. Siebers ◽  
Paul J. Keall ◽  
Mark R. Arnfield ◽  
Radhe Mohan

2021 ◽  
pp. 107962
Author(s):  
Julio Almansa ◽  
Francesc Salvat-Pujol ◽  
Gloria Díaz-Londoño ◽  
Artur Carnicer ◽  
Antonio M. Lallena ◽  
...  

2006 ◽  
Vol 128 (9) ◽  
pp. 945-952 ◽  
Author(s):  
Sandip Mazumder

Two different algorithms to accelerate ray tracing in surface-to-surface radiation Monte Carlo calculations are investigated. The first algorithm is the well-known binary spatial partitioning (BSP) algorithm, which recursively bisects the computational domain into a set of hierarchically linked boxes that are then made use of to narrow down the number of ray-surface intersection calculations. The second algorithm is the volume-by-volume advancement (VVA) algorithm. This algorithm is new and employs the volumetric mesh to advance the ray through the computational domain until a legitimate intersection point is found. The algorithms are tested for two classical problems, namely an open box, and a box in a box, in both two-dimensional (2D) and three-dimensional (3D) geometries with various mesh sizes. Both algorithms are found to result in orders of magnitude gains in computational efficiency over direct calculations that do not employ any acceleration strategy. For three-dimensional geometries, the VVA algorithm is found to be clearly superior to BSP, particularly for cases with obstructions within the computational domain. For two-dimensional geometries, the VVA algorithm is found to be superior to the BSP algorithm only when obstructions are present and are densely packed.


Sign in / Sign up

Export Citation Format

Share Document