Cut-cells algorithm. More...
Functions/Subroutines | |
| subroutine | cut_cells_2d (shape, cut_cell, reference_point, does_print_cut_cells) |
Cut-cells algorithm.
The algorithm first computes the intersection points between the shape and the grid. Second, the contour of the shape, based on the intersection points, is constructed. Third, the cells containing at least two connected segments are modified to have only one segment. Finally, the cells containing more than two non-linked segments undergo the super-face algorithm. This algorithm ensures:
| subroutine mod_cut_cells_2d::cut_cells_2d | ( | class(t_shape), intent(in) | shape, |
| type(t_cut_cell), intent(inout) | cut_cell, | ||
| double precision, dimension(:), intent(out), allocatable | reference_point, | ||
| logical, intent(in) | does_print_cut_cells ) |