共查询到20条相似文献,搜索用时 15 毫秒
1.
A knowledge-based and automatic finite element mesh generator (INTELMESH) for two-dimensional linear elasticity problems is presented. Unlike other approaches, the proposed technique incorporates the information about the object geometry as well as the boundary and loading conditions to generate an a priori finite element mesh which is more refined around the critical regions of the problem domain. INTELMESH uses a blackboard architecture expert system and the new concept of substracting to locate the critical regions in the domain and to assign priority and mesh size to them. This involves the decomposition of the original structure into substructures (or primitives) for which an initial and approximate analysis can be performed by using analytical solutions and heuristics. It then uses the concept of wave propagation to generate graded nodes in the whole domain with proper density distribution. INTELMESH is fully automatic and allows the user to define the problem domain with minimum amount of input such as object geometry and boundary and loading conditions. Once nodes have been generated for the entire domain, they are automatically connected to form well-shaped triangular elements ensuring the Delaunay property. Several examples are presented and discussed. When incorporated into and compared with the traditional approach to the adaptive finite element analysis, it is expected that the proposed approach, which starts the process with near optimal initial meshes, will be more accurate and efficient. 相似文献
2.
Skeleton-based computational method for the generation of a 3D finite element mesh sizing function 总被引:5,自引:0,他引:5
Quadros William Roshan Shimada Kenji Owen Steven James 《Engineering with Computers》2004,20(3):249-264
This paper focuses on the generation of a three-dimensional (3D) mesh sizing function for geometry-adaptive finite element (FE) meshing. The mesh size at a point in the domain of a solid depends on the geometric complexity of the solid. This paper proposes a set of tools that are sufficient to measure the geometric complexity of a solid. Discrete skeletons of the input solid and its surfaces are generated, which are used as tools to measure the proximity between geometric entities and feature size. The discrete skeleton and other tools, which are used to measure the geometric complexity, generate source points that determine the size and local sizing function at certain points in the domain of the solid. An octree lattice is used to store the sizing function as it reduces the meshing time. The size at every lattice-node is calculated by interpolating the size of the source points. The algorithm has been tested on many industrial models, and it can be extended to consider other non-geometric factors that influence the mesh size, such as physics, boundary conditions, etc.Sandia National Laboratory is a multiprogram laboratory operated by the Sandia Corporation, a Lockheed Martin Company, for the US Department of Energy under contract DE-AC04-94AL85000. 相似文献
3.
The finite element analysis in engineering applications comprises three phases: domain discretization, equation solving and error analysis. The domain discretization or mesh generation is the pre-processing phase which plays an important role in the achievement of accurate solutions. In this paper, the improvement of one particularly promising technique for generating two-dimensional meshes is presented. Our technique shows advantages and efficiency over some currently available mesh generators. 相似文献
4.
Wei Lin Youhong Tang Chengbi Zhao Xu Liu Gongquan Zhu Feng Jiang 《Computer aided design》2011,43(12):1803-1813
In this study, an algorithm is designed specifically for automatic finite element (FE) mesh generation on the transverse structure of hulls reinforced by stiffeners. Stiffeners attached to the transverse structure are considered as line constraints in the geometry boundary. For the FE mesh generation used in this study, the line constraints are treated as boundaries and by that means the geometry domain attached to the line constraints is decomposed into sub-domains, constrained only by the closed boundaries. Then, the mesh can be generated directly on those sub-domains by the traditional approach. The performance of the proposed algorithm is evaluated and the quality of the generated mesh meets expectations. 相似文献
5.
The use of complementary variational principles in finite element analysis is examined. It is shown that complementary finite element solutions provide an element by element measure of the accuracy of the solution. By solving a problem repeatedly, beginning with a coarse mesh and refining those elements having the largest errors, an automatic, foolproof finite element mesh generation procedure is developed. Finite element solutions obtained by the new procedure have the property that the finest elements are concentrated in regions of greatest need while large elements are found in less important regions. A computer program which implements the new algorithm is described and examples of finite element solutions generated by the program are presented. 相似文献
6.
Quasi-automatic 3D finite element model generation for individual single-rooted teeth and periodontal ligament 总被引:4,自引:0,他引:4
Clement R Schneider J Brambs HJ Wunderlich A Geiger M Sander FG 《Computer methods and programs in biomedicine》2004,73(2):135-144
The paper demonstrates how to generate an individual 3D volume model of a human single-rooted tooth using an automatic workflow. It can be implemented into finite element simulation. In several computational steps, computed tomography data of patients are used to obtain the global coordinates of the tooth's surface. First, the large number of geometric data is processed with several self-developed algorithms for a significant reduction. The most important task is to keep geometrical information of the real tooth. The second main part includes the creation of the volume model for tooth and periodontal ligament (PDL). This is realized with a continuous free form surface of the tooth based on the remaining points. Generating such irregular objects for numerical use in biomechanical research normally requires enormous manual effort and time. The finite element mesh of the tooth, consisting of hexahedral elements, is composed of different materials: dentin, PDL and surrounding alveolar bone. It is capable of simulating tooth movement in a finite element analysis and may give valuable information for a clinical approach without the restrictions of tetrahedral elements. The mesh generator of FE software ANSYS executed the mesh process for hexahedral elements successfully. 相似文献
7.
H. N. Gürsoy 《Engineering with Computers》1996,12(3-4):211-223
In this paper, the development and the implementation of a tetrahedral meshing algorithm for generation of finite element meshes from NURBS solid models is presented. The meshing algorithm is based on a Delaunay technique, and makes use of some spatial data structures. The algorithm is capable of generating both uniform and varying size four-node and ten-node tetrahedral meshes. The algorithm has been implemented in a building block approach as part of a software library. It has been used as a practical tool in engineering design processes. Several representative test cases illustrate the effectiveness of the automatic solid mesh generator. 相似文献
8.
The objective of this work was to develop and test a semi-automated finite element mesh generation method using computed tomography (CT) image data of a canine radius. The present study employs a direct conversion from CT Hounsfield units to elastic moduli. Our method attempts to minimize user interaction and eliminate the need for mesh smoothing to produce a model suitable for finite element analysis. Validation of the computational model was conducted by loading the CT-imaged canine radius in four-point bending and using strain gages to record resultant strains that were then compared to strains calculated with the computational model. Geometry-based and uniform modulus voxel-based models were also constructed from the same imaging data set and compared. The nonuniform voxel-based model most accurately predicted the axial strain response of the sample bone (R(2)=0.9764). 相似文献
9.
In this paper, attention is restricted to mesh adaptivity. Traditionally, the most common mesh adaptive strategies for linear problems are used to reach a prescribed accuracy. This goal is best met with an h-adaptive scheme in combination with an error estimator. In an industrial context, the aim of the mechanical simulations in engineering design is not only to obtain greatest quality but more often a compromise between the desired quality and the computation cost (CPU time, storage, software, competence, human cost, computer used). In this paper we propose the use of alternative mesh refinement with an h-adaptive procedure for 3D elastic problems. The alternative mesh refinement criteria allow to obtain the maximum of accuracy for a prescribed cost. These adaptive strategies are based on a technique of error in constitutive relation (the process could be used with other error estimators) and an efficient adaptive technique which automatically takes into account the steep gradient areas. This work proposes a 3D method of adaptivity with the latest version of the INRIA automatic mesh generator GAMHIC3D. 相似文献
10.
C. Leupi E. Miglio M. Altinakar A. Quarteroni M.O. Deville 《Computers & Fluids》2009,38(10):1903-1916
The present work deals with the validation of 3D finite element model for free-surface flows. The model uses the non-hydrostatic pressure and the eddy viscosities from the conventional linear turbulence model are modified to account for the secondary effects generated by strong channel curvature in the natural rivers with meandering open channels. The unsteady Reynolds-averaged Navier–Stokes equations are solved on the unstructured grid using the Raviart–Thomas finite element for the horizontal velocity components, and the common P1 linear finite element in the vertical direction. To provide the accurate resolution at the bed and the free-surface, the governing equations are solved in the multi-layers system (the vertical plane of the domain is subdivided into fixed thickness layers). The up-to-date k–ε turbulence solver is implemented for computing eddy coefficients, the Eulerian–Lagrangian–Galerkin (ELG) temporal scheme is performed for enhancing numerical time integration to guarantee high degree of mass conservation while the CFL restriction is eliminated. The present paper reports on successful validation of the numerical model through available benchmark tests with increasing complexity, using the high quality and high spatial resolution three-dimensional data set collected from experiments. 相似文献
11.
3D model hashing can be very useful for the authentication, indexing, copy detection, and watermarking of 3D content, in a manner similar to image hashing. 3D models can be easily modified by graphics editing while preserving the geometric shape, and the modeling representations are not regular, unlike an image with a fixed pixel array. A 3D model must be authenticated, indexed, or watermarked while being robust against graphics attacks and irregular representations. For these purposes, this paper presents a 3D mesh model hashing based on object feature vectors with the robustness, security, and uniqueness. The proposed hashing groups the distances from feature objects with the highest surface area in a 3D model that consists of a number of objects, permutes indices of groups in feature objects, and generates a binary hash through the binarization of feature values that are calculated by two combinations of group values and a random key. The robustness of a hash can be improved by group coefficients that are obtained from the distribution of vertex distances in feature objects, and the security and uniqueness can be improved by both the permutation of groups, feature vectors, and random key. Experimental results verified that the proposed hashing is robust against various perceptual geometrical and topological attacks and has the security and uniqueness of a hash. 相似文献
12.
Most of the existing approaches to bas-relief generation operate in image space, which is quite time-consuming in practice. This paper presents a different bas-relief generation algorithm based on geometric compression and starting from a 3D mesh input. The feature details are first extracted from the original objects using a spatial bilateral filtering technique. Then, a view-dependent coordinate mapping method is applied to build the height domain for the current view. After fitting the compression datum plane, the algorithm uses an adaptive compression function to scale and combine the Z values of the base mesh and the fine details. This approach offers control over the level of detail, making it flexible for the adjustment of the appearance of details. For a typical input mesh with 100 k triangles, this algorithm computes a bas-relief in 0.214 s. 相似文献
13.
在融合了交互式轮廓绘制与网格造型技术的基础上,提出了一种快速三维网格曲面建模方法.根据绘制轮廓线的特征点分布,进行约束化三角网格剖分,提取二维轮廓线的骨架;选取骨架点和采样点投影到三维空间椭球曲面,并引入二面角原则,优化了空间离散数据点的三角化算法;最后缝合骨架点,获得三维网格曲面表示.实验结果表明了该算法的直观性、高效性. 相似文献
14.
A mortar finite element discretization of the second order elliptic problem in three dimensions, on non-matching grids, using the 3D Crouzeix-Raviart (CR) finite element in each subdomain, is proposed in this paper. The overall discretization is based on using only the nodal values on the mortar side of a subdomain interface for the calculation of the mortar projection, as opposed to applying the conventional approach where some nodal values in the interior of a subdomain are also required. Since the interior degrees of freedom disappear completely from the computation of the mortar projection, the proposed algorithm becomes less intricate and more flexible as compared to the conventional approach. An error estimate is given, and some numerical experiments are presented. 相似文献
15.
16.
有限元网格划分相关问题分析研究 总被引:12,自引:8,他引:12
以有限元分析软件HyperMesh为计算平台,分析两个简单模型的静态受力产生的变形和应力,阐述有限元网格不同划分方法对计算精度的影响。 相似文献
17.
This paper presents a new robust, blind and good imperceptibility 3D mesh double watermarks algorithm. Two different kinds of watermarks are embedded into one 3D mesh model. One watermarking algorithm based on mesh feature segmentation and the DCT transformation, the other based on redundancy information of 3D model. The two watermarks do not disturb each other during embedding and extracting. Several mesh models are applied to test the robustness, imperceptibility and efficiency of the proposed algorithm. The experimental results show that the proposed watermark scheme can not only keep good imperceptibility but also resist various attacks, such as similarity transformations (translation, rotation, scaling and combinations of the three operations), file attack, signal processing attacks (noising, smoothing and vertex coordinate quantization) and connectivity attacks (cropping). 相似文献
18.
Sunken relief is an art form made by cutting the relief sculpture itself into a flat surface with a shallow overall depth. This paper focuses on the problem of direct generation of line-based sunken relief from a 3D mesh. We show how to extract, post-process and organize the messy feature lines in regular forms, applicable for lines engraving on the sculpture surfaces. We further describe how to construct a smooth height field from the input object, and derive a continuous pitting corrosion method to generate the cutting paths. The whole framework is conducted in object-space, making it flexible for stroke stylization and depth control of the engraving lines. We demonstrate the results with several impressive renderings and photographs used to illustrate the paper itself. 相似文献
19.
As the transmission of 3D shape models through Internet becomes more important, the compression issue of shape models gets more critical. While the compressions of topology and geometry have been explored significantly, the same issue for normal vectors has not yet been studied as much as it deserves.
Presented in this paper is an approach to compress the normal vectors of a 3D mesh model using the concept of clustering and relative indexing. The model is assumed to be manifold triangular mesh model with normal vectors associated with vertices. The proposed scheme clusters the normal vectors of given model and the representative normal vector of each cluster is referred to via a mixed use of relative as well as absolute indexing concepts. It turns out that the proposed approach achieves a significant compression ratio (less than 10% of the original VRML model files) without a serious sacrifice of the visual quality. 相似文献
20.
Jang Han-Ul Choi Hak-Yeol Son Jeongho Kim Dongkyu Hou Jong-Uk Choi Sunghee Lee Heung-Kyu 《Multimedia Tools and Applications》2018,77(5):5685-5712
Multimedia Tools and Applications - This paper presents a new approach to 3D mesh watermarking using consistent segmentation and mesh steganalysis. The method is blind, statistical, and highly... 相似文献