Optimization for Particle Tracking Algorithm of JCOGIN

The latest optimizations for particle tracking algorithms of JCOGIN were presented in this paper. Boundary particle locating and position estimation of source particles optimizations were adopted for particle locating algorithm, which can reduce a certain amount of particle locating calculations. Safety distance optimization and Boolean binary tree expanding method were applied in intersection algorithm. The safety distance optimization can reduce the intersection calculation frequency of electron transport, and the time complexity of Boolean solids intersection algorithm is cut down to O(n) by using the Boolean binary tree expanding method. Four typical models were used to verify the optimization effect. The optimizations of particle locating algorithm have a certain effect on general problems. The safety distance optimization significantly enhances the electron transport efficiency, and the Boolean binary tree expanding method greatly improves the calculation speed of JMCT for irregular and complex geometries.