• Title/Summary/Keyword: mesh smoothing

Search Result 62, Processing Time 0.024 seconds

OpenVolMesh: Generic and Efficient Data Structure for 3D Volumetric Meshes (OpenVolMesh: 삼차원 볼륨 기반의 메쉬 표현을 위한 범용적이고 효과적인 자료 구조)

  • Kim, Jun-Ho;Seo, Jin-Seok;Oh, Sei-Woong
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.7
    • /
    • pp.85-92
    • /
    • 2008
  • Meshes are the most appropriate data structures for representing 3D geometries. Surface meshes have been frequently used for representing 3D geometries, which only samples data on the surfaces of the given 3D geometries. Thanks to the improvements of computing powers, it is required to develop more complicated contents which utilize the volumetric information of 3D geometries. In this paper, we introduce a novel volumetric mesh libraries based on the half-face data structure, called OpenVolMesh, and describe its designs and implementations. The OpenVolMesh extends the OpenMesh, which is one of the most famous mesh libraries, by supporting volumetric meshes. The OpenVolMesh provides the generic programming, dynamic allocations of primitive properties, efficient array-based data structures, and source-level compatibility with OpenMesh. We show the usefulness of the OpenVolMesh in the developments of 3D volumetric contents with prototypic implementations such as volumetric mesh smoothing and CW-cell decompositions.

Application of Grid-based Approach for Auto Mesh Generation of Vacuum Chamber (자동 요소망 생성을 위한 격자구성기법 적용)

  • Lee J.S.;Park Y.J.;Chang Y.S.;Choi J.B.;Kim Y.J.
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2005.06a
    • /
    • pp.844-847
    • /
    • 2005
  • A seamless analysis of complex geometry is one of greatly interesting topic. However, there are still gaps between the industrial applications and fundamental academic studies owing to time consuming modeling process. To resolve this problem, an auto mesh generation program based on grid-based approach has been developed for IT-product in the present study. At first, base mesh and skin mesh are generated using the information of entities which extracted from IGES file. Secondly the provisional core mesh with rugged boundary geometry is constructed by superimposing the skin mesh as well as the base mesh generated from the CAD model. Finally, the positions of boundary nodes are adjusted to make a qualified mesh by adapting node modification and smoothing techniques. Also, for the sake of verification of mesh quality, the hexahedral auto mesh constructed by the program is compared with the corresponding tetrahedral free mesh and hexahedral mapped mesh through static finite element analyses. Thereby, it is anticipated that the grid-based approach can be used as a promising pre-processor for integrity evaluation of various IT-products.

  • PDF

A Study on 3D Smoothed Finite Element Method for the Analysis of Nonlinear Nearly-incompressible Materials (비선형 비압축성 물질의 해석을 위한 3차원 Smoothed FEM)

  • Lee, Changkye;Yee, Jurng-Jae
    • Journal of the Architectural Institute of Korea Structure & Construction
    • /
    • v.35 no.9
    • /
    • pp.159-169
    • /
    • 2019
  • This work presents the three-dimensional extended strain smoothing approach in the framework of finite element method, so-called smoothed finite element method (S-FEM) for quasi-incompressible hyperelastic materials undergoing the large deformations. The proposed method is known that the incompressible limits, such as over-estimation of stiffness and distorted mesh sensitivity, can be overcome in two dimensions. Therefore, in this paper, the idea of Cell-based, Edge-based and Node-based strain smoothing approaches is extended to three-dimensions. The construction of subcells and smoothing domains for each methods are explained. The smoothed strain-displacement matrix and the stiffness matrix are obtained on each smoothing domain in the same manner with two-dimensional S-FEM. Various numerical tests are studied to demonstrate the validity and accuracy of 3D-S-FEM. The obtained results are compared with analytical solutions to express the efficacy of the methods.

Automatic mesh generation on ship hull surface (선체 곡면의 자동 요소화)

  • 윤태경;김동준
    • Journal of Ocean Engineering and Technology
    • /
    • v.11 no.2
    • /
    • pp.138-144
    • /
    • 1997
  • This is describes the automatic mesh generation on the ship hull surface. At first ship hull is defined as a cillocation of composite surface patches which satisfy the geometic continuity between adjoining patches by using Gregory surface method. Node points that would be mesh points are ganerated by considering the surface curvature. The triangulation of the node points is by the combination of Ohtsubo's method and Choi's one. After triangulation, shape improvement and quadrilateralization is done with specific criterin. An application to the actual ship and the results are shown.

  • PDF

Inverse Finite Element Analysis of Autobody Structures with a Direct Mesh Mapping Method for Crash Analysis Considering Forming Effets (직접격자 사상법을 이용한 차체 구조물의 유한요소 역해석 및 성형효과를 고려한 충돌해석)

  • Kim, S.H.;Huh, H.
    • Transactions of Materials Processing
    • /
    • v.11 no.5
    • /
    • pp.457-464
    • /
    • 2002
  • A finite element inverse analysis is utilized to consider forming effects of an S-rail on the assessment of the crashworthiness with small amount of computation time. A crash analysis can be directly performed after the inverse simulation of a forming process without a smoothing or remeshing scheme. The direct mesh mapping method is used to calculate an initial guess from a sliding constraint surface that is extracted from the die and punch set. Analysis results demonstrate that energy absorption of structures is increased when simulation considers forming effects of thickness variation and work hardening. The finite element inverse analysis is proved to be an effective tool in consideration of forming effects for the crash analysis.

3D Reconstruction Algorithm using Stereo Matching and the Marching Cubes with Intermediate Iso-surface (스테레오 정합과 중간 등위면 마칭큐브를 이용한 3차원 재구성)

  • Cho In Je;Chai Young Ho
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.3
    • /
    • pp.173-180
    • /
    • 2005
  • This paper proposes an effective algorithm that combines both the stereo matching and the marching cube algorithm. By applying the stereo matching technique to an image obtained from various angles, 3D geometry data are acquired, and using the camera extrinsic parameter, the images are combined. After reconstructing the combined data into mesh using the image index, the normal vector equivalent to each point is obtained and the mesh smoothing is processed. This paper describes the successive processes and techniques on the 3D mesh reconstruction, and by proposing the intermediate iso- surface algorithm. Therefore it improves the 3D data instability problem caused when using the conventional marching cube algorithm.

Automatic Generation of Triangular Ginite Element Meshes on Three-Dimensional Surfaces (3차원 곡면에서 삼각형 유한요소망의 자동생성)

  • 채수원;손창현
    • Korean Journal of Computational Design and Engineering
    • /
    • v.1 no.3
    • /
    • pp.224-233
    • /
    • 1996
  • An automatic mesh generation scheme with triangular finite elements on three-dimensional surfaces has been developed. The surface triangulation process is performed as follows. To begin, surfaces with key nodes are transformed to two-dimensional planes and the meshes with triangular elements are constructed in these planes. Finally, the constructed meshes are transformed back to the original 3D surfaces. For the mesh generation, an irregular mesh generation scheme is employed in which local mesh densities are assigned by the user along the boundaries of the analysis domain. For this purpose a looping algorithm combined with an advancing front technique using basic operators has been developed, in which the loops are recursively subdivided into subloops with the use of the best split lines and then the basic operators generate elements. Using the split lines, the original boundaries are split recursively until each loop contains a certain number of key nodes, and then using the basic operators such as type-1 and type-2, one or two triangular elements are generated at each operation. After the triangulation process has been completed for each meshing domain, the resulting meshes are finally improved by smoothing process. Sample meshes are presented to demonstrate the versatility of the algorithm.

  • PDF

Advanced Design Environmental With Adaptive And Knowledge-Based Finite Elements

  • Haghighi, Kamyar;Jang, Eun
    • Proceedings of the Korean Society for Agricultural Machinery Conference
    • /
    • 1993.10a
    • /
    • pp.1222-1229
    • /
    • 1993
  • An advanced design environment , which is based on adaptive and knowledge -based finite elements (INTELMESH), has been developed. Unlike other approaches, INTEMMESH incorporates the information about the object geometry as well as the boundary and loading conditions to generate an ${\alpha}$-priori finite element mesh which is more refined around the critical regions of the problem domain. INTEMMESH is designed for planar domains and axisymmetric 3-D structures of elasticity and heat transfer subjected to mechanical and thermal loading . It intelligently identifies the critical regions/points in the problem domain and utilize the new concepts of substructuring and wave propagation to choose the proper mesh size for them. INTEMMESH generates well-shaped triangular elements by applying trangulartion and Laplacian smoothing procedures. The adaptive analysis involves the intial finite elements analyze and an efficient ${\alpha}$-posteriori error analysis involves the initial finite element anal sis and an efficient ${\alpha}$-posteriori error analysis and estimation . Once a problem is defined , the system automatically builds a finite element model and analyzes the problem though automatic iterative process until the error reaches a desired level. It has been shown that the proposed approach which initiates the process with an ${\alpha}$-priori, and near optimum mesh of the object , converges to the desired accuracy in less time and at less cost. Such an advanced design/analysis environment will provide the capability for rapid product development and reducing the design cycle time and cost.

  • PDF

An Efficient Load Balancing Scheme for Multi-Gateways in Wireless Mesh Networks

  • Liu, Junping;Chung, Sang-Hwa
    • Journal of Information Processing Systems
    • /
    • v.9 no.3
    • /
    • pp.365-378
    • /
    • 2013
  • In Wireless Mesh Networks (WMNs), we usually deploy multiple Internet Gateways (IGWs) to improve the capacity of WMNs. As most of the traffic is oriented towards the Internet and may not be distributed evenly among different IGWs, some IGWs may suffer from bottleneck problem. To solve the IGW bottleneck problem, we propose an efficient scheme to balance the load among different IGWs within a WMN. Our proposed load-balancing scheme consists of two parts: a traffic load calculation module and a traffic load migration algorithm. The IGW can judge whether the congestion has occurred or will occur by using a linear smoothing forecasting method. When the IGW detects that the congestion has occurred or will occur, it will firstly select another available IGW that has the lightest traffic load as the secondary IGW and then inform some mesh routers (MPs) which have been selected by using the Knapsack Algorithm to change to the secondary IGW. The MPs can return to their primary IGW by using a regression algorithm. Our Qualnet 5.0 experiment results show that our proposed scheme gives up to 18% end-to-end delay improvement compared with the existing schemes.

Triangular Grid Homogenization Using Local Improvement Method (국소개선기법을 이용한 삼각격자 균질화)

  • Choi, Hyung-Il;Jun, Sang-Wook;Lee, Dong-Ho;Lee, Do-Hyung
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.33 no.8
    • /
    • pp.1-7
    • /
    • 2005
  • This paper proposes a local improvement method that combines extended topological clean up and optimization-based smoothing for homogenizing triangular grid system. First extended topological clean up procedures are applied to improve the connectivities of grid elements. Then, local optimization-based smoothing is performed for maximizing the distortion metric that measures grid quality. Using the local improvement strategy, we implement the grid homogenizations for two triangular grid examples. It is shown that the suggested algorithm improves the quality of the triangular grids to a great degree in an efficient manner and also can be easily applied to the remeshing algorithm in adaptive mesh refinement technique.