Related papers: Snow Globe: An Advancing-Front 3D Delaunay Mesh Re…

For the numerical solution of shape optimization problems, particularly those constrained by partial differential equations (PDEs), the quality of the underlying mesh is of utmost importance. Particularly when investigating complex…

Triangle meshes remain the most popular data representation for surface geometry. This ubiquitous representation is essentially a hybrid one that decouples continuous vertex locations from the discrete topological triangulation.…

Image-based 3D reconstruction has increasingly stunning results over the past few years with the latest improvements in computer vision and graphics. Geometry and topology are two fundamental concepts when dealing with 3D mesh structures.…

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,…

There are very few mathematical results governing the interpolation of functions or their gradients on Delaunay meshes in more than two dimensions. Unfortunately, the standard techniques for proving optimal interpolation properties are…

We present an adaptive refinement algorithm for T-splines on unstructured 2D meshes. While for structured 2D meshes, one can refine elements alternatingly in horizontal and vertical direction, such an approach cannot be generalized directly…

This paper presents a 3D mesh adaptivity strategy on unstructured tetrahedral meshes by a posteriori error estimates based on metrics, studied on the case of a nonlinear finite element minimization scheme for the Landau-de Gennes free…

This article is the updated version of the paper: "Combined 3D thinning and greedy algorithm to approximate realistic particles with corrected mechanical properties, Granular Matter (2019)" by the first author [58]. The main changes here…

We propose a new refinement algorithm to generate size-optimal quality-guaranteed Delaunay triangulations in the plane. The algorithm takes $O(n \log n + m)$ time, where $n$ is the input size and $m$ is the output size. This is the first…

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 develop a new optimisation technique that combines multiresolution subdivision surfaces for boundary description with immersed finite elements for the discretisation of the primal and adjoint problems of optimisation. Similar to wavelets…

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…

We consider discretized two-dimensional PDE-constrained shape optimization problems, in which shapes are represented by triangular meshes. Given the connectivity, the space of admissible vertex positions was recently identified to be a…

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…

The signed volume function for polyhedra can be generalized to a mean volume function for volume elements by averaging over the triangulations of the underlying polyhedron. If we consider these up to translation and scaling, the resulting…

We present a new algorithm that produces a well-spaced superset of points conforming to a given input set in any dimension with guaranteed optimal output size. We also provide an approximate Delaunay graph on the output points. Our…

In this paper we propose a new approach to incrementally initialize a manifold surface for automatic 3D reconstruction from images. More precisely we focus on the automatic initialization of a 3D mesh as close as possible to the final…

Given a tetrahedral mesh and objective functionals measuring the mesh quality which take into account the shape, size, and orientation of the mesh elements, our aim is to improve the mesh quality as much as possible. In this paper, we…

Since the seminal work of Idelsohn, O\~nate and Del-Pin (2004), the Particle Finite Element Method (PFEM) has relied on a Delaunay triangulation and the Alpha--Shape (AS) algorithm in the remeshing process. This approach guarantees a good…

This paper presents a new O(nlog(n)) algorithm for computing the convex hull of a set of 3 dimensional points. The algorithm first sorts the point in (x,y,z) then incrementally adds sorted points to the convex hull using the constraint that…