相关论文: Study on Delaunay tessellations of 1-irregular cub…

An extension of the restricted Delaunay-refinement algorithm for surface mesh generation is described, where a new point-placement scheme is introduced to improve element quality in the presence of mesh size constraints. Specifically, it is…

<incorrect proofs; does not consider an important case because of which the proofs are wrong. The paper was withdrawn from submission> One of the objectives of a Delaunay mesh refinement algorithm is to produce meshes with tetrahedral…

The wide adoption of composite structures in the aerospace industry requires reliable numerical methods to account for the effects of various damage mechanisms, including delamination. Cohesive elements are a versatile and physically…

I present a 3D advancing-front mesh refinement algorithm that generates a constrained Delaunay mesh for any piecewise linear complex (PLC) and extend this algorithm to produce truly Delaunay meshes for any PLC. First, as in my recently…

This paper provides a comprehensive guide to generating unconstrained, simplicial, four-dimensional (4D), hypervolume meshes for space-time applications. While several universal procedures for constructing unconstrained, d-dimensional,…

The wide adoption of thermoplastic composites to reduce weight in structural parts requires reliable numerical methods to account for debonding between overmolded parts. Although cohesive elements are effective for debonding, the need for…

Delamination is a critical mode of failure that occurs between plies in a composite laminate. The cohesive element, developed based on the cohesive zone model, is widely used for modeling delamination. However, standard cohesive elements…

The Delaunay triangulation (DT) is one of the most common and useful triangulations of point sets $P$ in the plane. DT is not unique when $P$ is degenerate, specifically when it contains quadruples of co-circular points. One way to achieve…

We present a new accuracy condition for the construction of continuous mass-lumped elements. This condition is less restrictive than the one currently used and enabled us to construct new mass-lumped tetrahedral elements of degrees 2 to 4.…

We present 2-D, 3-D, and spherical mesh generators for the Finite Element Method (FEM) using triangular and tetrahedral elements. The mesh nodes are treated as if they were linked by virtual springs that obey Hooke's law. Given the desired…

We present a method for reconstructing triangle meshes from point clouds. Existing learning-based methods for mesh reconstruction mostly generate triangles individually, making it hard to create manifold meshes. We leverage the properties…

Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but…

If a finite element mesh contains concave elements, it is said to tangled. Tangled meshes can occur during mesh generation, mesh optimization, and large deformation simulations, and will lead to erroneous results during finite element…

We present new and efficient quadrature rules for computing the stiffness matrices of mass-lumped tetrahedral elements for wave propagation modelling. These quadrature rules allow for a more efficient implementation of the mass-lumped…

In this paper we introduce a $C^1$ spline space over mixed meshes composed of triangles and quadrilaterals, suitable for FEM-based or isogeometric analysis. In this context, a mesh is considered to be a partition of a planar polygonal…

We investigate the structure of crystalline particle arrays on constant mean curvature (CMC) surfaces of revolution. Such curved crystals have been realized physically by creating charge-stabilized colloidal arrays on liquid capillary…

We present a new numerical scheme to study systems of non-convex, irregular, and punctured particles in an efficient manner. We employ this method to analyze regular packings of odd-shaped bodies, not only from a nanoparticle but also both…

This paper tackles the challenging problem of constrained hexahedral meshing. An algorithm is introduced to build combinatorial hexahedral meshes whose boundary facets exactly match a given quadrangulation of the topological sphere. This…

This work proposes four novel hybrid quadrature schemes for the efficient and accurate evaluation of weakly singular boundary integrals (1/r kernel) on arbitrary smooth surfaces. Such integrals appear in boundary element analysis for…

In the current practices of both industry and academia, the convergence and accuracy of finite element calculations are closely related to the methods and quality of mesh generation. For years, the research on high-quality mesh generation…