Related papers: POLYLLA: Polygonal meshing algorithm based on term…
In this work, we present a boundary and hole detection approach that traverses all the boundaries of an edge-manifold triangular mesh, irrespectively of the presence of singular vertices, and subsequently determines and labels all holes of…
In this paper, we present a new polygonal finite element method, called the Zipped Finite Element Method, for star-shaped polygons. The proposed approach constructs high-order shape functions as linear combinations of standard finite…
Polytopal Element Methods (PEM) allow to solve differential equations on general polygonal and polyhedral grids, potentially offering great flexibility to mesh generation algorithms. Differently from classical finite element methods, where…
Mesh simplification is the process of reducing the number of vertices, edges and triangles in a three-dimensional (3D) mesh while preserving the overall shape and salient features of the mesh. A popular strategy for this is edge collapse,…
The presented article contains a 3D mesh generation routine optimized with the Metropolis algorithm. The procedure enables to produce meshes of a prescribed volume V_0 of elements. The finite volume meshes are used with the Finite Element…
In this paper we present an immersed weak Galerkin method for solving second-order elliptic interface problems on polygonal meshes, where the meshes do not need to be aligned with the interface. The discrete space consists of constants on…
We present a differentiable representation, DMesh, for general 3D triangular meshes. DMesh considers both the geometry and connectivity information of a mesh. In our design, we first get a set of convex tetrahedra that compactly tessellates…
We introduce a smoothing algorithm for triangle, quadrilateral, tetrahedral and hexahedral meshes whose centerpiece is a simple geometric triangle transformation. The first part focuses on the mathematical properties of the element…
Geometric rounding of a mesh is the task of approximating its vertex coordinates by floating point numbers while preserving mesh structure. Geometric rounding allows algorithms of computational geometry to interface with numerical…
Let $\mathcal{T}$ be a rooted and weighted tree, where the weight of any node is equal to the sum of the weights of its children. The popular Treemap algorithm visualizes such a tree as a hierarchical partition of a square into rectangles,…
We consider the discretization of a boundary value problem for a general linear second-order elliptic operator with smooth coefficients using the Virtual Element approach. As in [59] the problem is supposed to have a unique solution, but…
We revisit classical Virtual Element approximations on polygonal and polyhedral decompositions. We also recall the treatment proposed for dealing with decompositions into polygons with curved edges. In the second part of the paper we…
Recent probabilistic methods for 3D triangular meshes capture diverse shapes by differentiable mesh connectivity, but face high computational costs with increased shape details. We introduce a new differentiable mesh processing method that…
We consider a model Poisson problem in $\R^d$ ($d=2,3$) and establish error estimates for virtual element methods on polygonal or polyhedral meshes that can contain small edges ($d=2$) or small faces ($d=3$).
We introduce and analyze a lower envelope method (LEM) for the tracking of interfaces motion in multiphase problems. The main idea of the method is to define the phases as the regions where the lower envelope of a set of functions coincides…
In general dimension, there is no known total polynomial algorithm for either convex hull or vertex enumeration, i.e. an algorithm whose complexity depends polynomially on the input and output sizes. It is thus important to identify…
In this paper, a novel technique for tight outer-approximation of the intersection region of a finite number of ellipses in 2-dimensional (2D) space is proposed. First, the vertices of a tight polygon that contains the convex intersection…
A family of quadratic finite volume method (FVM) schemes are constructed and analyzed over tetrahedral meshes. In order to prove stability and error estimate, we propose the minimum V-angle condition on tetrahedral meshes, and the surface…
We describe a new algorithm to compute the geometric intersection number between two curves, given as edge vectors on an ideal triangulation. Most importantly, this algorithm runs in polynomial time in the bit-size of the two edge vectors.…
We present a general framework for computing two-dimensional Voronoi diagrams of different classes of sites under various distance functions. The framework is sufficiently general to support diagrams embedded on a family of two-dimensional…