The hybrid grid implemented DSMC method used in 2D triangular micro cavity flows

This paper was presented at the 3rd Micro and Nano Flows Conference (MNF2011), which was held at the Makedonia Palace Hotel, Thessaloniki in Greece. The conference was organised by Brunel University and supported by the Italian Union of Thermofluiddynamics, Aristotle University of Thessaloniki, University of Thessaly, IPEM, the Process Intensification Network, the Institution of Mechanical Engineers, the Heat Transfer Society, HEXAG - the Heat Exchange Action Group, and the Energy Institute.In this study a new hybrid grid is implemented in a 2D DSMC solver to be used in 2D triangular micro cavity flows. Currently DSMC is the prominent method to analyze micro scale gas flows which are rarefied. Because of the computational cost, DSMC solvers are generally used in rarefied gas conditions in which continuum based solvers are useless. If the efficiency of DSMC solvers is improved, the application range of these solvers can be increased further where the continuum based solvers dominate. Indexing the particles according to their cells is one of the main steps in the DSMC method. Either the particles are traced cell-by-cell along their trajectories or coordinate transformation techniques are used in this step. The first option requires complex trigonometric operations and search algorithms which are computationally expensive. But it can be used in both structured and unstructured grids. Although the second option is computationally more efficient, it demands specially tailored structured grids which are more geometry dependent compared to the unstructured grids. Here it is shown that a novel hybrid grid structure can be used successfully in 2D DSMC solver to analyze triangular shaped lid-driven micro cavity flows. Hybrid grids used in this study are much less dependent of the geometry like unstructured grids. Additionally, hybrid grids like structured grids facilitate coordinate transformation techniques in order to increase the efficiency of the particle indexing step in the DSMC method

Model-Invariant Hybrid RANS-LES Computations on Unstructured Meshes

Hybrid RANS-LES computations combine the bene ts of RANS and LES so that LES is used in regions where the accuracy of RANS deteriorates. The numerous hybrid approaches are limited by the speci cation of the LES-RANS interface, which can cause nonphysical results such as log-layer mismatch and low shear stress. The hybrid RANS-LES approach based on the concept of model invariance, mitigates these problems, enabling seamless blending of the RANS and LES regions while forming the basis for interpreting the results in the interface region. This hybrid formulation was implemented in the NASA FUN3D unstructured code and computations for ow in a channel at Reynolds number of 3300 (based on the channel half width h and the bulk in ow velocity u(infinity) were carried out. An isotropic stochastic turbulence generator was implemented to generate in ow turbulence. The present approach was able to eliminate the log-layer mismatch and predict the shear stress fairly well. Thus, the model-invariant hybrid formulation coupled with the isotropic turbulence in ow generation serves as a physically meaningful way of performing hybrid RANS-LES computations

VoroCrust: Voronoi Meshing Without Clipping

Polyhedral meshes are increasingly becoming an attractive option with particular advantages over traditional meshes for certain applications. What has been missing is a robust polyhedral meshing algorithm that can handle broad classes of domains exhibiting arbitrarily curved boundaries and sharp features. In addition, the power of primal-dual mesh pairs, exemplified by Voronoi-Delaunay meshes, has been recognized as an important ingredient in numerous formulations. The VoroCrust algorithm is the first provably-correct algorithm for conforming polyhedral Voronoi meshing for non-convex and non-manifold domains with guarantees on the quality of both surface and volume elements. A robust refinement process estimates a suitable sizing field that enables the careful placement of Voronoi seeds across the surface circumventing the need for clipping and avoiding its many drawbacks. The algorithm has the flexibility of filling the interior by either structured or random samples, while preserving all sharp features in the output mesh. We demonstrate the capabilities of the algorithm on a variety of models and compare against state-of-the-art polyhedral meshing methods based on clipped Voronoi cells establishing the clear advantage of VoroCrust output.Comment: 18 pages (including appendix), 18 figures. Version without compressed images available on https://www.dropbox.com/s/qc6sot1gaujundy/VoroCrust.pdf. Supplemental materials available on https://www.dropbox.com/s/6p72h1e2ivw6kj3/VoroCrust_supplemental_materials.pd

Simplex space-time meshes in thermally coupled two-phase flow simulations of mold filling

The quality of plastic parts produced through injection molding depends on many factors. Especially during the filling stage, defects such as weld lines, burrs, or insufficient filling can occur. Numerical methods need to be employed to improve product quality by means of predicting and simulating the injection molding process. In the current work, a highly viscous incompressible non-isothermal two-phase flow is simulated, which takes place during the cavity filling. The injected melt exhibits a shear-thinning behavior, which is described by the Carreau-WLF model. Besides that, a novel discretization method is used in the context of 4D simplex space-time grids [2]. This method allows for local temporal refinement in the vicinity of, e.g., the evolving front of the melt [10]. Utilizing such an adaptive refinement can lead to locally improved numerical accuracy while maintaining the highest possible computational efficiency in the remaining of the domain. For demonstration purposes, a set of 2D and 3D benchmark cases, that involve the filling of various cavities with a distributor, are presented.Comment: 14 pages, 11 Figures, 4 Table

Diamond-based models for scientific visualization

Hierarchical spatial decompositions are a basic modeling tool in a variety of application domains including scientific visualization, finite element analysis and shape modeling and analysis. A popular class of such approaches is based on the regular simplex bisection operator, which bisects simplices (e.g. line segments, triangles, tetrahedra) along the midpoint of a predetermined edge. Regular simplex bisection produces adaptive simplicial meshes of high geometric quality, while simplifying the extraction of crack-free, or conforming, approximations to the original dataset. Efficient multiresolution representations for such models have been achieved in 2D and 3D by clustering sets of simplices sharing the same bisection edge into structures called diamonds. In this thesis, we introduce several diamond-based approaches for scientific visualization. We first formalize the notion of diamonds in arbitrary dimensions in terms of two related simplicial decompositions of hypercubes. This enables us to enumerate the vertices, simplices, parents and children of a diamond. In particular, we identify the number of simplices involved in conforming updates to be factorial in the dimension and group these into a linear number of subclusters of simplices that are generated simultaneously. The latter form the basis for a compact pointerless representation for conforming meshes generated by regular simplex bisection and for efficiently navigating the topological connectivity of these meshes. Secondly, we introduce the supercube as a high-level primitive on such nested meshes based on the atomic units within the underlying triangulation grid. We propose the use of supercubes to associate information with coherent subsets of the full hierarchy and demonstrate the effectiveness of such a representation for modeling multiresolution terrain and volumetric datasets. Next, we introduce Isodiamond Hierarchies, a general framework for spatial access structures on a hierarchy of diamonds that exploits the implicit hierarchical and geometric relationships of the diamond model. We use an isodiamond hierarchy to encode irregular updates to a multiresolution isosurface or interval volume in terms of regular updates to diamonds. Finally, we consider nested hypercubic meshes, such as quadtrees, octrees and their higher dimensional analogues, through the lens of diamond hierarchies. This allows us to determine the relationships involved in generating balanced hypercubic meshes and to propose a compact pointerless representation of such meshes. We also provide a local diamond-based triangulation algorithm to generate high-quality conforming simplicial meshes

One machine, one minute, three billion tetrahedra

This paper presents a new scalable parallelization scheme to generate the 3D Delaunay triangulation of a given set of points. Our first contribution is an efficient serial implementation of the incremental Delaunay insertion algorithm. A simple dedicated data structure, an efficient sorting of the points and the optimization of the insertion algorithm have permitted to accelerate reference implementations by a factor three. Our second contribution is a multi-threaded version of the Delaunay kernel that is able to concurrently insert vertices. Moore curve coordinates are used to partition the point set, avoiding heavy synchronization overheads. Conflicts are managed by modifying the partitions with a simple rescaling of the space-filling curve. The performances of our implementation have been measured on three different processors, an Intel core-i7, an Intel Xeon Phi and an AMD EPYC, on which we have been able to compute 3 billion tetrahedra in 53 seconds. This corresponds to a generation rate of over 55 million tetrahedra per second. We finally show how this very efficient parallel Delaunay triangulation can be integrated in a Delaunay refinement mesh generator which takes as input the triangulated surface boundary of the volume to mesh