Search results

The purpose of this paper is to set up a new framework to enable direct modifications of volume meshes enriched with semantic information associated to multiple partitions. An instance of filleting operator is prototyped under this framework and presented in the paper.

In this paper, a generic mesh modification operator has been designed and a new instance of this operator for filleting finite element (FE) sharp edges of tetrahedral multi-partitioned meshes is also pro-posed. The filleting operator works in two main steps. The outer skin of the tetrahedral mesh is first deformed to round user-specified sharp edges while satisfying constraints relative to the shape of the so-called Virtual Group Boundaries. Then, in the filleting area, the positions of the inner nodes are relaxed to improve the aspect ratio of the mesh elements.

The classical mainstream methodology for product behaviour optimization involves the repetition of four steps: CAD modelling, meshing of CAD models, enrichment of models with FE simulation semantics and FEA. This paper highlights how this methodology could be simplified by two steps: simulation model modification and FEA. The authors set up a new framework to enable direct modifications of volume meshes enriched with semantic information associated to multiple partitions and the corresponding fillet operator is devised.

The proposed framework shows only a paradigm of direct modifications of semantic enriched meshes. It could be further more improved by adding or changing the modules inside. The fillet operator does not take into account the exact radius imposed by user. With this proposed fillet operator the mesh element density may not be enough high to obtain wished smoothness.

This paper fulfils an identified industry need to speed up the product behaviour analysis process by directly modifying the simulation semantic enriched meshes.

This paper aims to propose an automatic and direct method to manipulate global parameters of the object for prototyping and simulation, given an STL mesh model of a thin-walled object. Proposed method is useful in rapid prototyping, where changing the global parameters such as thickness, scaling local features or draft of walls of an STL mesh is often required. Presently, user needs to iterate over the cycle of modification of the computer-aided design (CAD) model and tessellating it to change the global parameters. The proposed algorithm eliminates the need for CAD model while manipulating those global properties, as it works directly with the mesh model.

Proposed algorithm automatically identifies walls and its thickness, and then, it extracts mid-surface from each wall. Global parameters are then modified by using these mid-surfaces.

Mesh directly modified and the mesh obtained by tessellating modified CAD model has same global properties; proposed method can also allow multiple parameters to be modified at the same time.

Input STL model is assumed to be error-free, where models containing errors like self-intersection will lead to incorrect mid-surfaces. Present algorithm assumes that the mid-surface represent of the input STL model is a manifold surface.

A novel algorithm of directly manipulating global parameters of a thin-walled object in its STL mesh model is proposed. The paper also presents a novel method of extracting mid-surface representation from a thin-wall STL mesh.

Due to the inability to directly apply an intra-oral image with esthetic restoration to restore tooth shape in the computer-aided design system, this paper aims to propose a method that can use two-dimensional contours obtained from the image for the three-dimensional dental mesh model restoration.

First, intra-oral image and smiling image are taken from the patient, then teeth shapes of the images are designed based on esthetic restoration concepts and the pixel coordinates of the teeth’s contours are converted into the vertex coordinates in the three-dimensional space. Second, the dental mesh model is divided into three parts – active part, passive part and fixed part – based on the teeth’s contours of the mesh model. Third, the vertices from the teeth’s contours of the dental model are matched with ones from the intra-oral image and with the help of matching operation, the target coordinates of each vertex in the active part can be calculated. Finally, the Laplacian-based deformation algorithm and mesh smoothing algorithm are performed.

Benefitting from the proposed method, the dental mesh model with esthetic restoration can be quickly obtained based on the intra-oral image that is the result of doctor-patient communication. Experimental results show that the quality of restoration meets clinical needs, and the typical time cost of the method is approximately one second. So the method is both time-saving and user-friendly.

The method provides the possibility to design personalized dental esthetic restoration solutions rapidly.

The purpose of this paper is to address error‐controlled adaptive finite element (FE) method for thin and thick plates. A procedure is presented for determining the most suitable plate model (among available hierarchical plate models) for each particular FE of the selected mesh, that is provided as the final output of the mesh adaptivity procedure.

The model adaptivity procedure can be seen as an appropriate extension to model adaptivity for linear elastic plates of so‐called equilibrated boundary traction approach error estimates, previously proposed for 2D/3D linear elasticity. Model error indicator is based on a posteriori element‐wise computation of improved (continuous) equilibrated boundary stress resultants, and on a set of hierarchical plate models. The paper illustrates the details of proposed model adaptivity procedure for choosing between two most frequently used plate models: the one of Kirchhoff and the other of Reissner‐Mindlin. The implementation details are provided for a particular case of the discrete Kirchhoff quadrilateral four‐node plate FE and the corresponding Reissner‐Mindlin quadrilateral with the same number of nodes. The key feature for those elements that they both provide the same quality of the discretization space (and thus the same discretization error) is the one which justifies uncoupling of the proposed model adaptivity from the mesh adaptivity.

Several numerical examples are presented in order to illustrate a very satisfying performance of the proposed methodology in guiding the final choice of the optimal model and mesh in analysis of complex plate structures.

The paper confirms that one can make an automatic selection of the most appropriate plate model for thin and thick plates on the basis of proposed model adaptivity procedure.

The purpose of this paper is to conduct a comparative analysis between a straight blade (SB) and a curved caudal-fin tidal turbine blade (CB) and to examine the aspects relating to geometry, turbulence modelling, non-dimensional forces lift and power coefficients.

The comparison utilises results obtained from a default horizontal axis tidal turbine with turbine models available from the literature. A computational design method was then developed and implemented for “horizontal axis tidal turbine blade”. Computational fluid dynamics (CFD) results for the blade design are presented in terms of lift coefficient distribution at mid-height blades, power coefficients and blade surface pressure distributions. Moving the CB back towards the SB ensures that the total blade height stays constant for all geometries. A 3D mesh independency study of a “straight blade horizontal axis tidal turbine blade” modelled using CFD was carried out. The grid convergence study was produced by employing two turbulence models, the standard k-ε model and shear stress transport (SST) in ANSYS CFX. Three parameters were investigated: mesh resolution, turbulence model, and power coefficient in the initial CFD, analysis.

It was found that the mesh resolution and the turbulence model affect the power coefficient results. The power coefficients obtained from the standard k-ε model are 15 to 20 per cent lower than the accuracy of the SST model. Further analysis was performed on both the designed blades using ANSYS CFX and SST turbulence model. The variation in pressure distributions yields to the varying lift coefficient distribution across blade spans. The lift coefficient reached its peak between 0.75 and 0.8 of the blade span where the total lift accelerates with increasing pressure before drastically dropping down at 0.9 onwards due to the escalating rotational velocity of the blades.

The work presents a computational design methodological approach that is entirely original. While this numerical method has proven to be accurate and robust for many traditional tidal turbines, it has now been verified further for CB tidal turbines.

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.

The purpose of this paper is to develop the core module of computer-aided three-dimensional garment pattern design system.

A progressive mesh cutting algorithm and mesh reshaping algorithm have been developed to cut a single mesh into multiple patches. A flat projection algorithm has been developed to project 3D patches into 2D patterns.

The software developed in this study is expected to enable its users to design complex garment patterns without the in-depth knowledge of pattern design process.

The mesh model used in this study was a fixed model. It will be extended to a deformable garment model that can be resized according to the underlying body model

The software developed in this study is expected to reduce the time required for time-consuming and trial-and-error-based pattern design process.

Fashion designers will be able to design complex patterns by themselves and the dependence upon expert patterners could be reduced

The progressive mesh cutting algorithm developed in this study can cut a mesh model using arbitrary lines. The mesh reshaping algorithm can improve the mesh quality of divided patches to increase the numerical stability during subsequent pattern flattening process. The flip removal algorithm can effectively remove the partially flipped mesh elements.

Gives a bibliographical review of the finite element meshing and remeshing from the theoretical as well as practical points of view. Topics such as adaptive techniques for meshing and remeshing, parallel processing in the finite element modelling, etc. are also included. The bibliography at the end of this paper contains 1,727 references to papers, conference proceedings and theses/dissertations dealing with presented subjects that were published between 1990 and 2001.

The purpose of this paper is to conduct a survey on research in fabric and cloth simulation using mass spring model. Also in this paper some of the common methods in process of fabric simulation in mass spring model are discussed and compared.

This paper reviews and compares presented mesh types in mass spring model, forces applied on model, super elastic effect and ways to settle the super elasticity problem, numerical integration methods for solving equations, collision detection and its response. Some of common methods in fabric simulation are compared to each other. And by using examples of fabric simulation, advantages and limitations of each technique are mentioned.

Mass spring method is a fast and flexible technique with high ability to simulate fabric behavior in real time with different environmental conditions. Mass spring model has more accuracy than geometrical models and also it is faster than other physical modeling.

In the edge of digital, fabric simulation technology has been considered into many fields. 3D fabric simulation is complex and its implementation requires knowledge in different fields such as textile engineering, computer engineering and mechanical engineering. Several methods have been presented for fabric simulation such as physical and geometrical models. Mass spring model, the typical physically based method, is one of the methods for fabric simulation which widely considered by researchers.

The purpose of this paper is to present an automatic approach for mesh sizing field generation of complicated  computer-aided design (CAD) models.

In this paper, the authors present an automatic approach for mesh sizing field generation. First, a source point extraction algorithm is applied to capture curvature and proximity features of CAD models. Second, according to the distribution of feature source points, an octree background mesh is constructed for storing element size value. Third, mesh size value on each node of background mesh is calculated by interpolating the local feature size of the nearby source points, and then, an initial mesh sizing field is obtained. Finally, a theoretically guaranteed smoothing algorithm is developed to restrict the gradient of the mesh sizing field.

To achieve high performance, the proposed approach has been implemented in multithreaded parallel using OpenMP. Numerical results demonstrate that the proposed approach is remarkably efficient to construct reasonable mesh sizing field for complicated CAD models and applicable for generating geometrically adaptive triangle/tetrahedral meshes. Moreover, since the mesh sizing field is defined on an octree background mesh, high-efficiency query of local size value could be achieved in the following mesh generation procedure.

How to determine a reasonable mesh size for complicated CAD models is often a bottleneck of mesh generation. For the complicated models with thousands or even ten thousands of geometric entities, it is time-consuming to construct an appropriate mesh sizing field for generating high-quality mesh. A parallel algorithm of mesh sizing field generation with low computational complexity is presented in this paper, and its usability and efficiency have been verified.