Mesh generation for finite element analysis is far from a solved problem. Although several automatic meshing algorithms exist, other difficulties of setting up a problem for finite element analysis still make this an interactive process. Undaunted, we continue to perform research on, and therefore publish, papers describing their work to overcome these problems. In our efforts to describe our w...

The development of robust high-order finite element methods requires the construction of valid high-order meshes for complex geometries without user intervention. This paper presents a novel approach for automatically generating a high-order mesh with two main features: first, the boundary of the mesh is globally smooth; second, the mesh boundary satisfies a required fidelity tolerance. Invalid...

An integrated tool developed for the construction of unstructured numerical grids about complex configurations is presented. The tool is highly integrated and employs the native underlying geometry modeling kernel used to define the target domain for providing topological and geometric access used by the grid generation procedures. This access greatly reduces the overall process time required t...

Two of the most successful methods to generate unstructured hexahedral meshes are the grid-based methods and the advancing front methods. On the one hand, the grid-based methods generate high quality elements in the inner part of the domain using an inside-outside approach. On the other hand, advancing front methods generate high quality hexahedra near the boundary using an outside-inside appro...

Three dimensional realistic simulation are often unsteady and include moving domains. One of major challenges associated with such simulations is the robust mesh generation for the moving domain. There has been significant research and development in this specific field[1, 2, 3, 4]. We describe a method for generating conforming tetrahedral mesh to the given C continuous surfaces in R immersed ...

51 participants attended this meeting. As in previous Dagstuhl seminars about Computational Geometry, the exchange of ideas and information about the latest developments in the fields of computational and combinatorial geometry was the main purpose of this meeting. In addition, there was a focus on a few topics on individual days of the meeting, featuring longer keynote talks as well as more te...

In this paper we study the problem of two-dimensional adaptive mesh generation using a variational approach and, specifically, the effect that the monitor function has on the resulting mesh behavior. The basic theoretical tools employed are Green’s function for elliptic problems and the eigendecomposition of symmetric positive definite matrices. Based upon this study, a general strategy is sugg...

We employ Maxwell’s equations formulated in Space-Time Algebra to perform discretization of moving geometries directly in space-time. All the derivations are carried out without any non-relativistic assumptions, thus the application area of the scheme is not restricted to low velocities. The 4D mesh construction is based on a 3D mesh stemming from a conventional 3D mesh generator. The movement ...