Related papers: Automatic surface mesh generation for discrete mod…

Reducing the triangle count in complex 3D models is a basic geometry preprocessing step in graphics pipelines such as efficient rendering and interactive editing. However, most existing mesh simplification methods exhibit a few issues.…

We introduce a novel representation and optimization framework for discrete geodesics on triangle meshes that reduces artifacts of linear methods on uneven and coarse discretizations. Our method computes squared geodesic distances from…

In this paper we develop a simple finite element method for simulation of embedded layers of high permeability in a matrix of lower permeability using a basic model of Darcy flow in embedded cracks. The cracks are allowed to cut through the…

We analyze a new framework for expressing finite element methods on arbitrarily many intersecting meshes: multimesh finite element methods. The multimesh finite element method, first presented in [40], enables the use of separate meshes to…

Stiffener layout optimization of complex surfaces is fulfilled within the framework of topology optimization. A combined parameterization method is developed in two aspects. One is to parameterize the material distribution of the stiffener…

We apply an unfitted HDG discretization to a model problem in shape optimization. The method proposed uses a fixed, shape regular, non-geometry conforming mesh and a high order transfer technique to deal with the curved boundaries arising…

We present a single-image head mesh reconstruction framework that addresses the longstanding challenge of simultaneously preserving facial identity and producing industry-grade topology. Our framework adopts a coarse-to-fine optimization…

Triangulated meshes have become ubiquitous discrete-surface representations. In this paper we address the problem of how to maintain the manifold properties of a surface while it undergoes strong deformations that may cause topological…

Surfaces are typically represented as meshes, which can be extracted from volumetric fields via meshing or optimized directly as surface parameterizations. Volumetric representations occupy 3D space and have a large effective receptive…

This paper proposes two contributions to the calculation of free surface flows using the particle finite element method (PFEM). The PFEM is based on a Lagrangian approach: a set of particles defines the fluid. Then, unlike a pure Lagrangian…

Smoothing and sharpening are two fundamental image processing operations. The latter is usually related to the former through the unsharp masking algorithm. In this paper, we develop a new type of filter which performs smoothing or…

Computational analysis with the finite element method requires geometrically accurate meshes. It is well known that high-order meshes can accurately capture curved surfaces with fewer degrees of freedom in comparison to low-order meshes.…

For linear elastic problems, it is well-known that mesh generation dominates the total analysis time. Different types of methods have been proposed to directly or indirectly alleviate this burden associated with mesh generation. We review…

This paper describes a node relocation algorithm based on nonlinear optimization which delivers excellent results for both unstructured and structured plane triangle meshes over convex as well as non-convex domains with high curvature. The…

Computational Fluid Dynamics (CFD) is widely used in different engineering fields, but accurate simulations are dependent upon proper meshing of the simulation domain. While highly refined meshes may ensure precision, they come with high…

A simple and efficient interface-fitted mesh generation algorithm is developed in this paper. This algorithm can produce a local anisotropic fitting mixed mesh which consists of both triangles and quadrilaterals near the interface. A new…

The typical goal of surface remeshing consists in finding a mesh that is (1) geometrically faithful to the original geometry, (2) as coarse as possible to obtain a low-complexity representation and (3) free of bad elements that would hamper…

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…

Spatially localized deformation components are very useful for shape analysis and synthesis in 3D geometry processing. Several methods have recently been developed, with an aim to extract intuitive and interpretable deformation components.…

Machine learning has been progressively generalised to operate within non-Euclidean domains, but geometrically accurate methods for learning on surfaces are still falling behind. The lack of closed-form Riemannian operators, the…