Related papers: On mesh refinement procedures for polygonal virtua…
This is a study of certain finite element methods designed for convection-dominated, time-dependent partial differential equations. Specifically, we analyze high order space-time tensor product finite element discretizations, used in a…
We consider within a finite element approach the usage of different adaptively refined meshes for different variables in systems of nonlinear, time-depended PDEs. To resolve different solution behaviours of these variables, the meshes can…
The virtual element method (VEM) is a stabilized Galerkin method that is robust and accurate on general polygonal meshes. This feature makes it an appealing candidate for simulations involving meshes with embedded interfaces and evolving…
Variational inequalities play a pivotal role in a wide array of scientific and engineering applications. This project presents two techniques for adaptive mesh refinement (AMR) in the context of variational inequalities, with a specific…
In this paper, we use the first-order virtual element method (VEM) to investigate the effect of shape quality of polyhedra in the estimation of the critical time step for explicit three-dimensional elastodynamic finite element (FE)…
This paper aims to develop an efficient adaptive finite element method for the second-order elliptic problem. Although the theory for adaptive finite element methods based on residual-type a posteriori error estimator and bisection…
We present a collection of algorithms which utilize dimensional reduction to perform mesh refinement and study possibly singular solutions of time-dependent partial differential equations. The algorithms are inspired by constructions used…
We present an administration technique for the bookkeeping of adaptive mesh refinement on (hyper-)rectangular meshes. Our technique is a unified approach for h-refinement on 1-, 2- and 3D domains, which is easy to use and avoids traversing…
We present a class of nonconforming virtual element methods for general fourth order partial differential equations in two dimensions. We develop a generic approach for constructing the necessary projection operators and virtual element…
Localized features such as singularities, sharp gradients, discontinuities, and moving sources require adaptive finite element discretizations. Conventional refinement strategies introduce significant computational overhead through…
We revisit the cell-based smoothed finite element method (SFEM) for quadrilateral elements and extend it to arbitrary polygons and polyhedrons in 2D and 3D, respectively. We highlight the similarity between the SFEM and the virtual element…
In this work we design a novel $C^1$-conforming virtual element method of arbitrary order $k \geq 2$, to solve the biharmonic problem on a domain with curved boundary and internal curved interfaces in two dimensions. By introducing a…
Voronoi intensity estimators, which are non-parametric estimators for intensity functions of point processes, are both parameter-free and adaptive; the intensity estimate at a given location is given by the reciprocal size of the…
We propose a quality-based optimization strategy to reduce the total number of degrees of freedom associated to a discrete problem defined over a polygonal tessellation with the Virtual Element Method. The presented Quality Agglomeration…
The presented article contains a 2D mesh generation routine optimized with the Metropolis algorithm. The procedure enables to produce meshes with a prescribed size h of elements. These finite element meshes can serve as standard discrete…
Virtual element methods (VEMs) without extrinsic stabilization in arbitrary degree of polynomial are developed for second order elliptic problems, including a nonconforming VEM and a conforming VEM in arbitrary dimension. The key is to…
We study the problem of decomposing a volume bounded by a smooth surface into a collection of Voronoi cells. Unlike the dual problem of conforming Delaunay meshing, a principled solution to this problem for generic smooth surfaces remained…
We study the problem of moving a vertex in an unstructured mesh of triangular, quadrilateral, or tetrahedral elements to optimize the shapes of adjacent elements. We show that many such problems can be solved in linear time using…
A variational framework, initially developed for high-order mesh optimisation, is being extended for r-adaptation. The method is based on the minimisation of a functional of the mesh deformation. To achieve adaptation, elements of the…
We present a method to jointly refine the geometry and semantic segmentation of 3D surface meshes. Our method alternates between updating the shape and the semantic labels. In the geometry refinement step, the mesh is deformed with…