Extension of on-surface radiation condition theory to scattering by two-dimensional homogeneous dielectric objects

1990 ◽  
Vol 38 (10) ◽  
pp. 1551-1558 ◽  
Author(s):  
S. Arendt ◽  
K.R. Umashankar ◽  
A. Taflove ◽  
G.A. Kriegsmann
Keyword(s):  
Radiation Condition ◽  
Surface Radiation ◽  
Two Dimensional ◽  
Dielectric Objects

scholarly journals The Computation of the Magnitude of the Far Field for an Eccentric Circular Cylinder

2015 ◽  
Vol 2015 ◽  
pp. 1-8
Author(s):  
Bülent Yılmaz
Keyword(s):  
Circular Cylinder ◽  
Plane Wave ◽  
Radiation Condition ◽  
Higher Order ◽  
Numerical Results ◽  
Surface Radiation ◽  
Far Field ◽  
Condition Method ◽  
Radiation Conditions

The specific case of scattering of a plane wave by a two-layered penetrable eccentric circular cylinder has been considered and it is about the validity of the on surface radiation condition method and its applications to the scattering of a plane wave by a two-layered penetrable eccentric circular cylinder. The transformation of the problem of scattering by the eccentric circular cylinder to the problem of scattering by the concentric circular cylinder by using higher order radiation conditions, is observed. Numerical results presented the magnitude of the far field.

Methods to Accelerate Ray Tracing in the Monte Carlo Method for Surface-to-Surface Radiation Transport

2006 ◽  
Vol 128 (9) ◽  
pp. 945-952 ◽  
Author(s):  
Sandip Mazumder
Keyword(s):  
Monte Carlo ◽  
Ray Tracing ◽  
Radiation Transport ◽  
Three Dimensional ◽  
Intersection Point ◽  
Surface Radiation ◽  
Computational Domain ◽  
Two Dimensional ◽  
Spatial Partitioning ◽  
The Monte Carlo Method

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