Related papers: Face-based Volume-of-Fluid interface positioning i…
This paper investigates an elliptic interface problem with discontinuous diffusion coefficients on unfitted meshes, employing the CutFEM method. The main contribution is the a posteriori error analysis based on equilibrated fluxes belonging…
Surfactant transport plays an important role in many technical processes and industrial applications such as chemical reactors, microfluidics, printing and coating technology. High fidelity numerical simulations of two-phase flow phenomena…
The plane-cube intersection problem has been around in literature since 1984 and iterative solutions to it have been used as part of piecewise linear interface construction (PLIC) in computational fluid dynamics simulation codes ever since.…
Local grid refinement aims to optimise the relationship between accuracy of the results and number of grid nodes. In the context of the finite volume method no single local refinement criterion has been globally established as optimum for…
The aim of this contribution is to address the convergence study of a time and space approximation scheme for an Allen-Cahn problem with constraint and perturbed by a multiplicative noise of It\^o type. The problem is set in a bounded…
We derive lower estimates for the approximation of the $d$-dimensional Euclidean ball by polytopes with a fixed number of $k$-dimensional faces, $k\in\{0,1,\ldots,d-1\}$. The metrics considered include the intrinsic volume difference and…
Crashing ocean waves, cappuccino froths and microfluidic bubble crystals are examples of foamy flows. Foamy flows are critical in numerous natural and industrial processes and remain notoriously difficult to compute as they involve coupled,…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
This paper meticulously revisit and study the flux geometry of any compact oriented manifold $(M; W)$. We generalize several well-known factorization results, exhibit some orbital conditions for the study of flux geometry, give a proof of…
We show that the theory of varifolds can be suitably enriched to open the way to applications in the field of discrete and computational geometry. Using appropriate regularizations of the mass and of the first variation of a varifold we…
We study the problem of approximating the mixed volume $V(P_1^{(\alpha_1)}, \dots, P_k^{(\alpha_k)})$ of an $k$-tuple of convex polytopes $(P_1, \dots, P_k)$, each of which is defined as the convex hull of at most $m_0$ points in…
This study proposes a novel adaptive finite volume-particle method (AFVPM) for accurate and efficient free surface flow simulations. The proposed AFVPM synergistically combines the Eulerian finite volume method (FVM) on unstructured meshes…
We give a method for computing asymptotic formulas and approximations for the volumes of spectrahedra, based on the maximum-entropy principle from statistical physics. The method gives an approximate volume formula based on a single convex…
The calculation of the volume enclosed by curved surfaces discretized into triangular elements, and a cube is of great importance in different domains, such as computer graphics and multiphase flow simulations. We propose a robust…
Abstract notions of convexity over the vertices of a graph, and corresponding notions of halfspaces, have recently gained attention from the machine learning community. In this work we study monophonic halfspaces, a notion of graph…
In this paper we propose an efficient second order well balanced finite volume method for modeling complex free surface flows at the aid of a simple diffuse interface method. The employed physical model is a two-phase model derived from the…
There has been an increasing interest in developing efficient immersed boundary method (IBM) based on Cartesian grids, recently in the context of high-order methods. IBM based on volume penalization is a robust and easy to implement method…
We introduce a new computational methodology for the identification and characterization of free volume within/around atomistic configurations. This scheme employs a three-stage workflow, by which spheres are iteratively grown inside of…
This paper introduces a novel transformer-based network architecture, FlowFormer, along with the Masked Cost Volume AutoEncoding (MCVA) for pretraining it to tackle the problem of optical flow estimation. FlowFormer tokenizes the 4D…
A new algorithm for the determination of the relative convex hull in the plane of a simple polygon A with respect to another simple polygon B which contains A, is proposed. The relative convex hull is also known as geodesic convex hull, and…