Vertex location optimisation for improved remeshing

Remeshing aims to produce a more regular mesh from a given input mesh, while representing the original geometry as accurately as possible. Many existing remeshing methods focus on where to place new mesh vertices; these samples are placed exactly on the input mesh. However, considering the output mesh as a piecewise linear approximation of some geometry, this simple scheme leads to significant systematic error in non-planar regions. Here, we use parameterised meshes and the recent mathematical development of orthogonal approximation using Sobolev-type inner products to develop a novel sampling scheme which allows vertices to lie in space near the input surface, rather than exactly on it. The algorithm requires little extra computational effort and can be readily incorporated into many remeshing approaches. Experimental results show that on average, approximation error can be reduced by 40% with the same number of vertices

Galerkin projection of discrete fields via supermesh construction

Interpolation of discrete FIelds arises frequently in computational physics. This thesis focuses on the novel implementation and analysis of Galerkin projection, an interpolation technique with three principal advantages over its competitors: it is optimally accurate in the L2 norm, it is conservative, and it is well-defined in the case of spaces of discontinuous functions. While these desirable properties have been known for some time, the implementation of Galerkin projection is challenging; this thesis reports the first successful general implementation. A thorough review of the history, development and current frontiers of adaptive remeshing is given. Adaptive remeshing is the primary motivation for the development of Galerkin projection, as its use necessitates the interpolation of discrete fields. The Galerkin projection is discussed and the geometric concept necessary for its implementation, the supermesh, is introduced. The efficient local construction of the supermesh of two meshes by the intersection of the elements of the input meshes is then described. Next, the element-element association problem of identifying which elements from the input meshes intersect is analysed. With efficient algorithms for its construction in hand, applications of supermeshing other than Galerkin projections are discussed, focusing on the computation of diagnostics of simulations which employ adaptive remeshing. Examples demonstrating the effectiveness and efficiency of the presented algorithms are given throughout. The thesis closes with some conclusions and possibilities for future work

Energy conservation during remeshing in the analysis of dynamic fracture

The analysis of (dynamic) fracture often requires multiple changes to the discretisation during crack propagation. The state vector from the previous time step must then be transferred to provide the initial values of the next time step. A novel methodology based on a least‐squares fit is proposed for this mapping. The energy balance is taken as a constraint in the mapping, which results in a complete energy preservation. Apart from capturing the physics better, this also has advantages for numerical stability. To further improve the accuracy, Powell‐Sabin B‐splines, which are based on triangles, have been used for the discretisation. Since urn:x-wiley:nme:media:nme6142:nme6142-math-0001 continuity of the displacement field holds at crack tips for Powell‐Sabin B‐splines, the stresses at and around crack tips are captured much more accurately than when using elements with a standard Lagrangian interpolation, or with NURBS and T‐splines. The versatility and accuracy of the approach to simulate dynamic crack propagation are assessed in two case studies, featuring mode‐I and mixed‐mode crack propagation

Evolutionary topology optimization using the extended finite element method and isolines

This study presents a new algorithm for structural topological optimization of two-dimensional continuum structures by combining the extended finite element method (X-FEM) with an evolutionary optimization algorithm. Taking advantage of an isoline design approach for boundary representation in a fixed grid domain, X-FEM can be implemented to improve the accuracy of finite element solutions on the boundary during the optimization process. Although this approach does not use any remeshing or moving mesh algorithms, final topologies have smooth and clearly defined boundaries which need no further interpretation. Numerical comparisons of the converged solutions with standard bi-directional evolutionary structural optimization solutions show the efficiency of the proposed method, and comparison with the converged solutions using MSC NASTRAN confirms the high accuracy of this method

ICASE/LaRC Workshop on Adaptive Grid Methods

Solution-adaptive grid techniques are essential to the attainment of practical, user friendly, computational fluid dynamics (CFD) applications. In this three-day workshop, experts gathered together to describe state-of-the-art methods in solution-adaptive grid refinement, analysis, and implementation; to assess the current practice; and to discuss future needs and directions for research. This was accomplished through a series of invited and contributed papers. The workshop focused on a set of two-dimensional test cases designed by the organizers to aid in assessing the current state of development of adaptive grid technology. In addition, a panel of experts from universities, industry, and government research laboratories discussed their views of needs and future directions in this field

A triangular grid generation and optimization framework for the design of free-form gridshells

Gridshells have been widely used in various public buildings, and many of them are defined over complex free-form surfaces with complex boundaries. This emphasizes the importance of general grid generation and optimization methods in the initial design stage to achieve visually sound and easy-to-manufacture structure. In this paper, a framework is presented to generate uniform, well-shaped and fluency triangular grids for structural design over free-form surfaces, especially those with complex boundaries. The framework employs force-based algorithms and a connectivity-regularization algorithm to optimize grid quality. First, an appropriate distribution of internal points is randomly generated on the surface. Secondly, a bubble-packing method is employed to increase the uniformity of the initial point distribution, and the points are connected using Delaunay-based triangularization to produce an initial grid with rods of balanced length. Thirdly, the grid connectivity is optimized using a range of edge-operations including edge-flip, collapse and split. The optimization process features a grid relaxation objective which includes the degree of the vertices, leading to improved regularity. As a final step, the grid is relaxed to improve fluency using a net-like method. As part of its contribution, this paper, therefore, proposes a metric for fluency, which can be used to quantitatively evaluate the suitability of a given grid for architectural and structural expression. Two case-study examples are presented to demonstrate the effective execution of the grid generation and optimization framework. It is shown that by using the proposed framework, the fluency index of the grid can be improved by up to 157%