Abstract
We consider an oct-tree (quad-tree in 2D) such that there is never more than one level of difference between a cell and a neighbor-cell.
Each cell noted \$C\$ has a volume fraction \$C\$. Cells have two additional variables, an integer flag \$s\$ and a floating point height \$h\$. The algorithm computes a height whenever it can find a simply connected set of cells where: 1) the width of the stack is constant 2) the bottom cells are full 3) the top cells are empty and 4) the intermediate cells are all neither full nor empty. The exact definitions of full and empty are given in the full presentation of the VOF method. At the end of the algorithm, either the height function cannot be computed for the cell, or the variable \$h\$ equals to height of the cell.
Users
Please
log in to take part in the discussion (add own reviews or comments).