The voxelisator program of the Chair for Computation in Engineering (Technical University of Munich) is used to generate a voxel model from a geometric surface model. Geomet- ric intersection tests are used to generate a voxel mesh that refines towards the geometry. Eventually, a mesh description for OpenFOAM is written out. The output of the Open- FOAM mesh description works for a uniform mesh but not for a non-uniform mesh. This is because the face areas of adjacent voxels can no longer be compared for different levels of refinement. This work presents an algorithm that finds neighbouring voxel cells using a space-filling curve, so face areas don’t have to be compared any more. Instead, face areas of adjacent voxel cells with different levels of refinement can be written out directly through a voxel-neighbour search algorithm. Therefore, Morton codes are assigned to each voxel in a first step. Secondly, all potential neighbours of a voxel cell are calculated and finally it is verified which of the potential neighbours actually exist so the OpenFOAM mesh description can be written out.     «

The voxelisator program of the Chair for Computation in Engineering (Technical University of Munich) is used to generate a voxel model from a geometric surface model. Geomet- ric intersection tests are used to generate a voxel mesh that refines towards the geometry. Eventually, a mesh description for OpenFOAM is written out. The output of the Open- FOAM mesh description works for a uniform mesh but not for a non-uniform mesh. This is because the face areas of adjacent voxels can no longer be com...     »