Search results

The concepts of solution error and optimal mesh in adaptive finite element analysis are revisited. It is shown that the correct evaluation of the convergence rate of the error norms involved in the error measure and the optimal mesh criteria chosen are essential to avoid oscillations in the refinement process. Two mesh optimality criteria based on: (a) the equal distribution of global error, and (b) the specific error over the elements are studied and compared in detail through some examples of application.

A knowledge‐based system for forming quadrilateral finite elements, XFORMQ, was developed at the Centre of Flexible Manufacturing Research and Development of McMaster University, Canada. It automatically forms quadrilateral elements of good quality in conjunction with existing triangular mesh generators. XFORMQ can model geometries as complicated as those handled by triangular mesh generators. It allows for pre‐specified element sizes and rapid transition of element density. The concepts of ‘layer’ and ‘polygon patterns’, which considerably simplify the mesh generation rules and ensure the quality of formed elements, are introduced. Several test cases with different degrees of difficulties were used to evaluate XFORMQ's capabilities with satisfactory results. XFORMQ has the potential of generating meshes arising from the adaptive finite element analysis with quadrilateral elements.

This article describes a method for mesh generation, suitable for applications of the finite‐element method, which proceeds fully automatically from a geometric model of the object provided by a CAD‐system. It first generates a coarse mesh which is then adapted to fit the finite‐element problem. A resulting system of equations can be solved by a Gaussian‐type matrix method with as few computations as are necessary for a well‐banded matrix, but without the need for node or element numbering.

This paper aims to present an algorithm for local mesh refinement of finite elements in a two‐dimensional compressible fluid flow.

The algorithm works on a principle of maximum gradient of fluid variables, e.g. pressure, velocity and density. The simulation of two‐dimensional, transient, viscous, compressible, adiabatic flow of turbulent fluid through a De Laval nozzle was performed by the finite element method. The pressure gradient was used as a condition for mesh refinement.

With the gradient method faster numerical calculations can be obtained. Boundary layer separation and locations of normal shock waves can be described on locally refined mesh.

Further development of the algorithm is required, especially the determination of the gradient criterion.

The paper provides a new approach to mesh refinement. The mesh is refined automatically. Calculation time and required computer memory are decreased.

This paper presents an algorithm for automatic generation of graded initial quadrilateral meshes targeted for the finite element analysis of metal‐forming processes. Meshing the domain geometry deals with a universe of shapes, and the procedure therefore takes into account the initial geometry of the billet. A grid‐based approach is utilised for generating an initial coarse mesh with well‐shaped (internal) elements, and in cases where non‐rectangular shapes are to be discretized, linking with the boundary is performed on the basis of constrained Delaunay triangulation. By analysing the contact situation between dies and mesh, an attempt is made to identify regions where plastic deformation is likely to be concentrated during the early stages of processing, and accordingly refinement of the mesh is performed locally by elemental subdivision. Simulation examples for closed‐die forging, forward rod and backward can extrusion substantiate the feasibility of this approach in terms of lowering the overall calculation error and limiting the interference between mesh and die.

FEM analysis has been increasingly employed to simulate sheetmetal forming processes for industrial application purposes. From the simulation results, finite element analysts are able to predict the occurrences of splits and wrinkles therefore they can make recommendations of changes to the die design and/or to the part design to avoid possible stamping failures. The number of real die tryouts can be reduced, thus, the design cycle is shortened and manufacturing costs lowered. In the early times, application analysts were mostly concentrated on simulation of the stamping process itself starting from simple models, later running full size 3D models with large number of elements.

This paper aims to propose a method to evaluate the information obtained on harmonics calculations and to estimate the precision of results using finite element method for an innovative motor topology in which some well-known meshing rules are difficult to apply.

The same magnetostatic problem is solved with several mesh sizes using both scalar and vector potentials magnetics formulations on a complex topology, an axial claw pole motor (ACPM). The proposed method lies in a comparison between the two weak formulations to determine what information is obtained on harmonics calculations and to estimate its precision. Moreover, an original mesh method is applied in the air gap to improve the numerical results.

The precision on harmonics calculations using finite element method on an ACPM is estimated. For the proposed motor and mesh, only the mean value (even with large mesh) and the first harmonic (with fine mesh) of torque are calculated with a good accuracy. This results confirm that the non-respect of the meshing rules have a strong impact on the results and that scalar and vector potentials magnetics formulations do not give exactly the same results. Before using torque harmonics values in vibration calculations, a finite element model has to be validated by using both fomulations.

This method is time-consuming and only applied on an ACPM in this work.

The axial claw pole motor, for which the classic meshing rules cannot be applied, is a complex topology very under-studied. To improve the calculation of space harmonics, the authors proposed to split the airgap into four parts. Then in the two central parts, the meshing step of the structured mesh is equal to the rotating step.

The paper presents a method for the patterns simulation in the 3D virtual stitching and try-on system.

First, the patterns are designed using the garment CAD software and stored in the DXF format. Second, the regular grid method is employed to mesh the patterns to be quadrangular, and the patterns triangular meshing can be obtained by connecting the diagonal of the quadrangular. Then a mass-spring model is established, and the forces analysis and the explicit Euler integration method are employed to accomplish the patterns simulation. The paper demonstrates the robustness of our simulation through two sets of experiments, including a lady’s dress patterns meshing experiments and the experiments of the virtual stitching of the lady’s dress.

The patterns meshing algorithm can meet the requirements of the internal meshing and the boundary meshing, and it is very important to select an appropriate meshing density. The implementation of the virtual stitching of the lady’s dress proves the effectiveness and usability of the simulation methods.

The lady’s dress used in the experiments is a relatively simple fashion style, with only the front and back pattern. It is very worthy of further research on the effectiveness of the complex structure of clothing.

The paper includes practical implications of the methods of the patterns meshing and the virtual stitching of the simple fashion styles.

The simulation system is developed using VC++ 2015 with the help of the OpenGL functions library, which is proved as a simple, lower computation and robustness for the patterns simulation of the simple garments.

The primary objective of this study is to tackle the enduring challenge of preserving feature integrity during the manipulation of geometric data in computer graphics. Our work aims to introduce and validate a variational sparse diffusion model that enhances the capability to maintain the definition of sharp features within meshes throughout complex processing tasks such as segmentation and repair.

We developed a variational sparse diffusion model that integrates a high-order L₁ regularization framework with Dirichlet boundary constraints, specifically designed to preserve edge definition. This model employs an innovative vertex updating strategy that optimizes the quality of mesh repairs. We leverage the augmented Lagrangian method to address the computational challenges inherent in this approach, enabling effective management of the trade-off between diffusion strength and feature preservation. Our methodology involves a detailed analysis of segmentation and repair processes, focusing on maintaining the acuity of features on triangulated surfaces.

Our findings indicate that the proposed variational sparse diffusion model significantly outperforms traditional smooth diffusion methods in preserving sharp features during mesh processing. The model ensures the delineation of clear boundaries in mesh segmentation and achieves high-fidelity restoration of deteriorated meshes in repair tasks. The innovative vertex updating strategy within the model contributes to enhanced mesh quality post-repair. Empirical evaluations demonstrate that our approach maintains the integrity of original, sharp features more effectively, especially in complex geometries with intricate detail.

The originality of this research lies in the novel application of a high-order L₁ regularization framework to the field of mesh processing, a method not conventionally applied in this context. The value of our work is in providing a robust solution to the problem of feature degradation during the mesh manipulation process. Our model’s unique vertex updating strategy and the use of the augmented Lagrangian method for optimization are distinctive contributions that enhance the state-of-the-art in geometry processing. The empirical success of our model in preserving features during mesh segmentation and repair presents an advancement in computer graphics, offering practical benefits to both academic research and industry applications.

Hexahedral meshing is one of the most important steps in performing an accurate simulation using the finite element analysis (FEA). However, the current hexahedral meshing method in the industry is a nonautomatic and inefficient method, i.e. manually decomposing the model into suitable blocks and obtaining the hexahedral mesh from these blocks by mapping or sweeping algorithms. The purpose of this paper is to propose an almost automatic decomposition algorithm based on the 3D frame field and model features to replace the traditional time-consuming and laborious manual decomposition method.

The proposed algorithm is based on the 3D frame field and features, where features are used to construct feature-cutting surfaces and the 3D frame field is used to construct singular-cutting surfaces. The feature-cutting surfaces constructed from concave features first reduce the complexity of the model and decompose it into some coarse blocks. Then, an improved 3D frame field algorithm is performed on these coarse blocks to extract the singular structure and construct singular-cutting surfaces to further decompose the coarse blocks. In most modeling examples, the proposed algorithm uses both types of cutting surfaces to decompose models fully automatically. In a few examples with special requirements for hexahedral meshes, the algorithm requires manual input of some user-defined cutting surfaces and constructs different singular-cutting surfaces to ensure the effectiveness of the decomposition.

Benefiting from the feature decomposition and the 3D frame field algorithm, the output blocks of the proposed algorithm have no inner singular structure and are suitable for the mapping or sweeping algorithm. The introduction of internal constraints makes 3D frame field generation more robust in this paper, and it can automatically correct some invalid 3–5 singular structures. In a few examples with special requirements, the proposed algorithm successfully generates valid blocks even though the singular structure of the model is modified by user-defined cutting surfaces.

The proposed algorithm takes the advantage of feature decomposition and the 3D frame field to generate suitable blocks for a mapping or sweeping algorithm, which saves a lot of simulation time and requires less experience. The user-defined cutting surfaces enable the creation of special hexahedral meshes, which was difficult with previous algorithms. An improved 3D frame field generation method is proposed to correct some invalid singular structures and improve the robustness of the previous methods.