计算非结构化网格中浸没三角化曲面的体积分数和符号距离
Computing volume fractions and signed distances from triangulated surfaces immersed in unstructured meshes
AI总结：
提出一种新算法，在非结构化网格上从任意形状曲面计算符号距离和体积分数，通过几何计算和拉普拉斯方程传播信息，适用于多相流模拟。
摘要：
现有的用于初始化体积分数的算法通常利用精确函数来模拟流体界面，或者依赖于体积网格之间计算成本高昂的相交操作。本文提出了一种新算法，用于在非结构化网格上从任意形状的曲面（例如来自实验数据的曲面）计算符号距离和体积分数。该算法在流体界面附近几何地计算符号距离，该界面近似为三角形表面网格，并通过拉普拉斯方程的近似解来传播内部/外部信息。体积分数基于符号距离计算，使用非结构化网格的单元与表示界面的表面网格子集之间的几何相交，或使用多项式近似和自适应网格细化。虽然该算法主要针对多相流模拟开发，但也可潜在地用于其他需要相位指示器的问题：在任意非结构化网格上相对于任意形状曲面的内部/外部信息。
英文摘要：
Available algorithms for the initialization of volume fractions typically utilize exact functions to model fluid interfaces, or they rely on computationally costly intersections between volume meshes. Here, a new algorithm is proposed that computes signed distances and volume fractions on unstructured meshes from arbitrarily shaped surfaces, e.g. originating from experimental data. The proposed algorithm calculates signed distances geometrically near the fluid interface, approximated as a triangle surface mesh, and propagates the inside/outside information by an approximate solution of a Laplace equation. Volume fractions are computed based on signed distances, using either geometrical intersections between cells of the unstructured mesh and a sub-set of the surface mesh that represents the interface, or using a polynomial approximation and adaptive mesh refinement. Although primarily developed for multiphase flow simulations, the proposed algorithm can potentially be used for other problems that require a phase-indicator: inside/outside information with respect to an arbitrarily shaped surface on arbitrarily unstructured meshes.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
