get_unique_master_cell.F File Reference

#include "implicit_f.inc"
#include "comlock.inc"

Go to the source code of this file.

Functions/Subroutines
integer function	get_unique_main_cell (nin, ib, k)

Function/Subroutine Documentation

get_unique_main_cell()

integer function get_unique_main_cell	(	integer	nin,
		integer	ib,
		integer	k )

Definition at line 33 of file get_unique_master_cell.F.

C-----------------------------------------------
C   D e s c r i p t i o n
C----------------------------------------------- 
C Interface Type22 (/INTER/TYPE22) is an FSI coupling method based on cut cell method. 
C   This experimental cut cell method is not completed, abandoned, and is not an official option.
C
! With interface 22 Hexahedral cell is cut and
! main one is the biggest one which is greater
! then 50%. In case of multiple choice (2 are
! 50%-50% or several if criteria is reduced) we
! must ensure a unique choice which is repeatable
! with plateform and also different numbering.
!
! Here is chosen a sort by coordinates weighting
! X,Y,Z components. a score is computed
C-----------------------------------------------
C   M o d u l e s
C----------------------------------------------- 
      USE initbuf_mod
      USE i22bufbric_mod 
      USE i22tri_mod
      USE elbufdef_mod
C-----------------------------------------------
C   I m p l i c i t   T y p e s
C-----------------------------------------------
#include      "implicit_f.inc"
C-----------------------------------------------
C   C o m m o n   B l o c k s
C-----------------------------------------------
#include      "comlock.inc"
C-----------------------------------------------
C   D u m m y   A r g u m e n t s
C-----------------------------------------------
      INTEGER   :: NIN,IB,K
      INTEGER   :: GET_UNIQUE_MAIN_CELL
C-----------------------------------------------
C   L o c a l   V a r i a b l e s
C-----------------------------------------------
      INTEGER   ::  IsMain, N, IPOS, LEVEL, ICELL
      my_real   ::  centroid(3,k), score(k), min, nextmin
C-----------------------------------------------
C   P r e - C o n d i t i o n
C----------------------------------------------- 
      !IF(INT22==0)RETURN   !already checked
      !IF(K<2)  RETURN   !already checked
C-----------------------------------------------
C   S o u r c e    L i n e s
C----------------------------------------------- 
      centroid(:,:) = zero
      n             = 0
      ipos          = 1
      level         = 3   !3:X, 2:Y, 1:Z
      score(1:k)    = zero
      
      DO icell = 1, 9
        ismain = brick_list(nin,ib)%POLY(icell)%IsMain
        IF(ismain==0)cycle
        n = n + 1
        centroid(1:3,n) = brick_list(nin,ib)%POLY(icell)%CellCenter(1:3)
      ENDDO
 
      DO WHILE(level >= 1) 
        ipos        = minloc(centroid(4-level,1:k),1)
        min         = centroid(4-level,ipos)       !init with maximum value
        DO WHILE (ipos < k)
          ipos        = minloc(centroid(4-level,ipos+1:k),1)
          nextmin      = centroid(4-level,ipos)
          IF(nextmin == min) THEN
            score(ipos) = score(ipos) + 10**level
            ipos        = ipos + 1
          ENDIF
        enddo!next IPOS
        ipos  = 1
        level = level -1
      enddo!next LEVEL
 
      ipos                   = maxloc(score(1:k),1)
      get_unique_main_cell = ipos
      
      RETURN