相关论文: An exact general remeshing scheme applied to physi…
We introduce a fast and invertible approximation for data simulated as 2D planar meshes with connectivities along the poloidal dimension in deforming 3D toroidal (donut-like) spaces generated by fusion simulations. In fusion simulations,…
An exact conservative remapping scheme requires overlaps between two meshes and a reconstruction scheme on the old cells (Lagrangian mesh). While the are intensive discussion on reconstruction schemes, there are relative sparse discussion…
This paper addresses two problems needed to support four-dimensional ($3d + t$) spacetime numerical simulations. The first contribution is a general algorithm for producing conforming spacetime meshes of moving geometries. Here, the surface…
In [L. Chen and R. Li, Journal of Scientific Computing, Vol. 68, pp. 1172--1197, (2016)], an integrated linear reconstruction was proposed for finite volume methods on unstructured grids. However, the geometric hypothesis of the mesh to…
Finite element methods based on cut-cells are becoming increasingly popular because of their advantages over formulations based on body-fitted meshes for problems with moving interfaces. In such methods, the cells (or elements) which are…
This paper presents a novel intersection-based remapping method for isoparametric curvilinear meshes within the indirect arbitrary Lagrangian-Eulerian (ALE) framework, addressing the challenges of transferring physical quantities between…
Agglomeration techniques can be successfully employed to reduce the computational costs of numerical simulations and stand at the basis of multilevel algebraic solvers. To automatically perform mesh agglomeration, we propose a novel…
This article introduces a general mesh intersection algorithm that exactly computes the so-called Weiler model (also called an arrangement) and that uses it to implement boolean operations with arbitrary multi-operand expressions, CSG…
In this paper we present an efficient active-set method for the solution of convex quadratic programming problems with general piecewise-linear terms in the objective, with applications to sparse approximations and risk-minimization. The…
We present a constrained transport (CT) algorithm for solving the 3D ideal magnetohydrodynamic (MHD) equations on a moving mesh, which maintains the divergence-free condition on the magnetic field to machine-precision. Our CT scheme uses an…
This work presents a high-accuracy, mesh-free, generalized Stokes theorem-based numerical quadrature scheme for integrating functions over trimmed parametric surfaces and volumes. The algorithm relies on two fundamental steps: (1) We…
Convex approximation sets for multiobjective optimization problems are a well-studied relaxation of the common notion of approximation sets. Instead of approximating each image of a feasible solution by the image of some solution in the…
We fully generalize a previously-developed computational geometry tool [1] to perform large-scale simulations of arbitrary two-dimensional faceted surfaces $z = h(x,y)$. Our method uses a three-component facet/edge/junction storage model,…
The treatment of complex geometries in Computational Fluid Dynamics applications is a challenging endeavor, which immersed boundary and cut-cell techniques can significantly simplify by alleviating the meshing process required by…
We develop an all-hex meshing strategy for the interstitial space in beds of densely packed spheres that is tailored to turbulent flow simulations based on the spectral element method (SEM). The SEM achieves resolution through elevated…
In this work, we introduce new families of nonconforming approximation methods for reconstructing functions on general polygonal meshes. These methods are defined using degrees of freedom based on weighted moments of orthogonal polynomials…
We describe a simple geometric transformation of triangles which leads to an efficient and effective algorithm to smooth triangle and tetrahedral meshes. Our focus lies on the convergence properties of this algorithm: we prove the…
In order to reduce the computational cost of the simulation of electromagnetic responses in geophysical settings that involve highly heterogeneous media, we develop a multiscale finite volume method with oversampling for the quasi-static…
This paper presents a new technique for the virtual reality (VR) visu-alization of complex volume images obtained from computer tomography (CT) and Magnetic Resonance Imaging (MRI) by combining three-dimensional (3D) mesh processing and…
The problem of polycube construction or deformation is an essential problem in computer graphics. In this paper, we present a robust, simple, efficient and automatic algorithm to deform the meshes of arbitrary shapes into their polycube…