02.05.2014 Views

PENELOPE 2003 - OECD Nuclear Energy Agency

PENELOPE 2003 - OECD Nuclear Energy Agency

PENELOPE 2003 - OECD Nuclear Energy Agency

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

5.3. Constructive quadric geometry 161<br />

1<br />

1<br />

4<br />

2<br />

3<br />

2<br />

5<br />

3 6<br />

Figure 5.2: Example of simple quadric geometry; an arrow within a sphere (the corresponding<br />

definition file is given in section 5.7). The solid triangles indicate the outside of the surfaces<br />

(side pointer = +1). Numbers in squares indicate bodies.<br />

the new material. To do this, we must determine the intersections of the track segment<br />

r 0 + tˆd (0 < t ≤ s) with all the surfaces that limit the body B (including those that<br />

limit other bodies that limit B), and check if the final position r 0 + sˆd remains in B<br />

or not. The reason for using only quadric surfaces is that these intersections are easily<br />

calculated by solving a quadratic equation.<br />

Notice that bodies can be concave, i.e., the straight segment joining any two points in<br />

a body may not be wholly contained in the body. Hence, even when the final position of<br />

the particle lies within the initial body, we must analyze all the intersections of the path<br />

segment with the limiting surfaces of B and check if the particle has left the body after<br />

any of the intersections. When the particle leaves the initial body, say after travelling a<br />

distance s ′ (< s), we have to locate the point r ′ = r 0 +s ′ˆd. The easiest method consists of<br />

computing the side pointers of all surfaces of the system at r ′ , and determining the body<br />

B ′ that contains r ′ by analyzing the side pointers of the different bodies in ascending<br />

order. It is clear that, for complex geometries, this is a very slow process. We can speed<br />

it up by simply disregarding those elements of the system that cannot be reached in a<br />

single step (e.g. bodies that are “screened” by other bodies). Unfortunately, as a body<br />

can be limited by all the other bodies that have been defined previously, the algorithm<br />

can be improved only at the expense of providing it with additional information. We<br />

shall adopt a simple strategy that consists of lumping groups of bodies together to form<br />

modules.<br />

A module is defined as a connected volume 3 , limited by quadric surfaces, that contains<br />

one or several bodies. A module can contain other modules, which will be referred<br />

to as submodules of the first. The volume of a module is filled with a homogeneous<br />

medium, which automatically fills the cavities of the module (i.e. volumes that do not<br />

3 A space volume is said to be connected when any two points in the volume can be joined by an arc<br />

of curve that is completely contained within the volume.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!