On estimating the interface normal and curvature in PLIC-VOF approach for 3D arbitrary meshes

Volume of fluid (VOF) method with its Piecewise Linear Interface Calculation (PLIC) reconstruction algorithm is one of the most popular approaches in numerical simulation of interfacial flows with a wide range of applications in different areas. In an effort to evaluate the similarity of the PLIC-generated planes in comparison with the exact interface, a point-cloud, based on the polygon centers of PLIC planes is extracted, which later is used to form a triangular grid that represents the estimated interface. The main objective of this article is to evaluate the interface geometrical properties based on the extracted triangular grid of the interface. The methods presented in this article, characterized by a higher spatially convergence ratio, are compared with the commonly used methods. The proposed methods are tested for two 3-dimensional general test cases, where an evident improvement is seen in calculation accuracy and spatial convergence of the errors of interface normal vector and curvature.This work has been financially supported by MCIN/AEI/10.13039/ 501100011033 Spain, project PID2020-115837RBI00. E. Schillaci acknowledges the financial support of the Programa Torres Quevedo (PTQ2018-010060).Peer ReviewedPostprint (author's final draft

Fornax: a Flexible Code for Multiphysics Astrophysical Simulations

This paper describes the design and implementation of our new multi-group, multi-dimensional radiation hydrodynamics (RHD) code Fornax and provides a suite of code tests to validate its application in a wide range of physical regimes. Instead of focusing exclusively on tests of neutrino radiation hydrodynamics relevant to the core-collapse supernova problem for which Fornax is primarily intended, we present here classical and rigorous demonstrations of code performance relevant to a broad range of multi-dimensional hydrodynamic and multi-group radiation hydrodynamic problems. Our code solves the comoving-frame radiation moment equations using the M1 closure, utilizes conservative high-order reconstruction, employs semi-explicit matter and radiation transport via a high-order time stepping scheme, and is suitable for application to a wide range of astrophysical problems. To this end, we first describe the philosophy, algorithms, and methodologies of Fornax and then perform numerous stringent code tests, that collectively and vigorously exercise the code, demonstrate the excellent numerical fidelity with which it captures the many physical effects of radiation hydrodynamics, and show excellent strong scaling well above 100k MPI tasks.Comment: Accepted to the Astrophysical Journal Supplement Series; A few more textual and reference updates; As before, one additional code test include

Constrained-Transport Magnetohydrodynamics with Adaptive-Mesh-Refinement in CHARM

We present the implementation of a three-dimensional, second order accurate Godunov-type algorithm for magneto-hydrodynamic (MHD), in the adaptive-mesh-refinement (AMR) cosmological code {\tt CHARM}. The algorithm is based on the full 12-solve spatially unsplit Corner-Transport-Upwind (CTU) scheme. The fluid quantities are cell-centered and are updated using the Piecewise-Parabolic-Method (PPM), while the magnetic field variables are face-centered and are evolved through application of the Stokes theorem on cell edges via a Constrained-Transport (CT) method. The multidimensional MHD source terms required in the predictor step for high-order accuracy are applied in a simplified form which reduces their complexity in three dimensions without loss of accuracy or robustness. The algorithm is implemented on an AMR framework which requires specific synchronization steps across refinement levels. These include face-centered restriction and prolongation operations and a {\it reflux-curl} operation, which maintains a solenoidal magnetic field across refinement boundaries. The code is tested against a large suite of test problems, including convergence tests in smooth flows, shock-tube tests, classical two- and three-dimensional MHD tests, a three-dimensional shock-cloud interaction problem and the formation of a cluster of galaxies in a fully cosmological context. The magnetic field divergence is shown to remain negligible throughout.Comment: 53 pages, 17 figs, under review by ApJ

Surface Reconstruction from Unorganized Point Cloud Data via Progressive Local Mesh Matching

This thesis presents an integrated triangle mesh processing framework for surface reconstruction based on Delaunay triangulation. It features an innovative multi-level inheritance priority queuing mechanism for seeking and updating the optimum local manifold mesh at each data point. The proposed algorithms aim at generating a watertight triangle mesh interpolating all the input points data when all the fully matched local manifold meshes (umbrellas) are found. Compared to existing reconstruction algorithms, the proposed algorithms can automatically reconstruct watertight interpolation triangle mesh without additional hole-filling or manifold post-processing. The resulting surface can effectively recover the sharp features in the scanned physical object and capture their correct topology and geometric shapes reliably. The main Umbrella Facet Matching (UFM) algorithm and its two extended algorithms are documented in detail in the thesis. The UFM algorithm accomplishes and implements the core surface reconstruction framework based on a multi-level inheritance priority queuing mechanism according to the progressive matching results of local meshes. The first extended algorithm presents a new normal vector combinatorial estimation method for point cloud data depending on local mesh matching results, which is benefit to sharp features reconstruction. The second extended algorithm addresses the sharp-feature preservation issue in surface reconstruction by the proposed normal vector cone (NVC) filtering. The effectiveness of these algorithms has been demonstrated using both simulated and real-world point cloud data sets. For each algorithm, multiple case studies are performed and analyzed to validate its performance

Simulation techniques for cosmological simulations

Modern cosmological observations allow us to study in great detail the evolution and history of the large scale structure hierarchy. The fundamental problem of accurate constraints on the cosmological parameters, within a given cosmological model, requires precise modelling of the observed structure. In this paper we briefly review the current most effective techniques of large scale structure simulations, emphasising both their advantages and shortcomings. Starting with basics of the direct N-body simulations appropriate to modelling cold dark matter evolution, we then discuss the direct-sum technique GRAPE, particle-mesh (PM) and hybrid methods, combining the PM and the tree algorithms. Simulations of baryonic matter in the Universe often use hydrodynamic codes based on both particle methods that discretise mass, and grid-based methods. We briefly describe Eulerian grid methods, and also some variants of Lagrangian smoothed particle hydrodynamics (SPH) methods.Comment: 42 pages, 16 figures, accepted for publication in Space Science Reviews, special issue "Clusters of galaxies: beyond the thermal view", Editor J.S. Kaastra, Chapter 12; work done by an international team at the International Space Science Institute (ISSI), Bern, organised by J.S. Kaastra, A.M. Bykov, S. Schindler & J.A.M. Bleeke

Robust Feature-Preserving Mesh Denoising Based on Consistent Sub-Neighborhoods

published_or_final_versio