Related papers: A unifying moving mesh method for curves, surfaces…
A meshless method is presented to solve the radiative transfer equation in the even parity formulation of the discrete ordinates method in complex 2D and 3D geometries. Prediction results of radiative heat transfer problems obtained by the…
We present a simple yet effective method for skeleton-free motion retargeting. Previous methods transfer motion between high-resolution meshes, failing to preserve the inherent local-part motions in the mesh. Addressing this issue, our…
The mathematical formulation, basic concept and numerical implementation of a new meshless method for solving three dimensional fluid flow and related heat transfer problems are presented in this paper. Moving least squares approximation is…
We present a unified framework for solving partial differential equations (PDEs) using video-inpainting diffusion transformer models. Unlike existing methods that devise specialized strategies for either forward or inverse problems under…
We develop a structure-preserving computational framework for acoustic wave scattering by moving objects, comprising a new PML-domain-embedding model and a compatible numerical approximation. The model couples a perfectly matched layer…
We extend the Balancing Domain Decomposition by Constraints (BDDC) method to flows in porous media discretised by mixed-hybrid finite elements with combined mesh dimensions. Such discretisations appear when major geological fractures are…
We present a one-dimensional high-order moving-mesh finite element method for moving boundary problems where the boundary velocity depends implicitly on the solution in the interior of the domain. The method employs a conservative arbitrary…
We examine the use of domain decomposition for potentially more efficient mean curvature flow of surface meshes, whose faces are arbitrary simple polygons. We first test traditional domain decomposition methods with and without overlap of…
In this paper, we propose a new variational framework for 3D surface denoising over triangulated meshes, which is inspired by the success of semi-sparse regularization in image processing. Differing from the uniformly sampled image data,…
We provide a new proof of convergence to motion by mean curvature (MMC) for the Merriman-Bence-Osher (MBO) thresholding algorithm. The proof is elementary and does not rely on maximum principle for the scheme. The strategy is to construct a…
The field of multiple view geometry has seen tremendous progress in reconstruction and calibration due to methods for extracting reliable point features and key developments in projective geometry. Point features, however, are not available…
We propose a geometric perspective to describe the motion of self-propelled particles moving at constant speed in d dimensions. We exploit the fact that the vector that conveys the direction of motion of the particle performs a random walk…
We present a computational approach for unfolding 3D shapes isometrically into the plane as a single patch without overlapping triangles. This is a hard, sometimes impossible, problem, which existing methods are forced to soften by allowing…
The morphological classification of galaxies is considered a relevant issue and can be approached from different points of view. The increasing growth in the size and accuracy of astronomical data sets brings with it the need for the use 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…
In this paper, we propose a consistent parallel unstructured mesh generator based on a multi-phase SPH method. A set of physics-motivated modeling equations are developed to achieve the targets of domain decomposition, communication volume…
The patch dynamics scheme in equation-free multiscale modelling can efficiently predict the macroscopic behaviours by simulating the microscale problem in a fraction of the space-time domain. The patch dynamics schemes developed so far, are…
We prove the convergence of a particle method for the approximation of diffusive gradient flows in one dimension. This method relies on the discretisation of the energy via non-overlapping balls centred at the particles and preserves the…
Mirror descent uses the mirror function to encode geometry and constraints, improving convergence while preserving feasibility. Accelerated Mirror Descent Methods (Acc-MD) are derived from a discretization of an accelerated mirror ODE…
One approach to achieving correct finite element assembly is to ensure that the local orientation of facets relative to each cell in the mesh is consistent with the global orientation of that facet. Rognes et al. have shown how to achieve…