In this section the domain decomposition algorithm implemented in CalculiX is explained in more detail, taking interface loading as example (cf. Section 6.11.3; the main routine is interfaceloading.c). It runs as follows:
![]() |
(946) |
and its center of gravity
![]() |
(947) |
leading to its mean slave plane satisfying:
| (948) |
is the number of nodes belonging to the slave face,
the spatial coordinates of the nodes and
the local
normal in the nodes in the spatial configuration. Notice that a slave face does not have to be plane.
| (949) |
where
are the local
coordinates of the integration point within the clipped slave face triangle (
) and
),
are the local coordinates of
the vertices of the clipped polygon triangle within the master face and
are the local coordinates of
the integration point within the master face. For each integration point,
increment the integration point counter nintpoint by one, store its local
coordinates within the master face and the weight in pmastload(1..3,nintpoint), store the
slave face (10*element+local face) into imastload(1,nintpoint) and a pointer
to any previous interface loading for this master face in
imastload(2,nintpoint). If an interface loading iload already exists for the master face
at stake, set nelemload(2,iload)=nintpoint, if not, create such loading. An
interfaceloading is characterized by a label sideload(iload) starting with 'I'.
The other way around, an interface loading i is characterized by sideload(i)(1:1)='I'. The master face with this loading is determined by the elenent number nelemload(1) and a local face number sideload(i)(2:2). The first integration point for this loading is at location j=nelemload(2) in fields imastload and pmastload yielding the local coordinates pmastload(1..2,j), the weight pmastload(3,j), the slave face imastload(1,j) and a pointer to the next integration point imastload(2,j), and so on until imastload(2,k)=0 for some k. The slave face is important, since the interface loading defined by the user on this slave face specifies the size of the loading and the load amplitude, if applicable.
One notices from the above discussion that the Sutherland-Hodgman algorithm is an important element in the overall algorithm. It clips a slave face (face a-b-c-d-e-f-g-h in Figure 185) by a convex master polygon (e.g. polygon 1-2-3 in Figure 185). The viewing angle in the figure is from outside onto the slave face, therefore the slave face is numbered counterclockwise, while the master polygon is numbered clockwise. The clipping is done taking one master polygon edge at a time, starting e.g. by edge 1-2. If the edge is active, it is deactivated, since an edge can belong to at most two master faces. Now, the edge is extended indefinitely (dot-dashed line in Figure 185) and the state of each slave surface edge w.r.t. this line is verified. The following cases arise:
After all master polygon edges have been treated, a check is performed whether at least 3 vertices belong to the clipped master face. If not, all master polygon edges are deactivated.